Write down Regular Expressions for the following languages. A. Strings of alphabet {a, b, c} which contains ab and ac as substrings. B. Strings of alphabet {0, 1, 2..9} which contains the odd years of 20th century. [Sample Accepted Strings: 2001, 2999, 2301.] C. {w|w ends with an even nonzero number of O's} D. {w|w has at least 3 characters and the 3rd character is 0} E. {w |w neither contain two consecutive a's nor two consecutive b's } F. {w | w is any string except bb and bbb} G. Strings of alphabet {a, b, c} with odd number of a's followed by even number of b's. H. Student ID of BSCSE students of UIU from Spring 2017 till Spring 2019. Assume that UIU has only 300 I. students admitted in each trimester. Sample accepted strings: 011171001, 011182135, 011191300.

Write down Regular Expressions for the following languages. A. Strings of alphabet {a, b, c} which contains ab and ac as substrings. B. Strings of alphabet {0, 1, 2..9} which contains the odd years of 20th century. [Sample Accepted Strings: 2001, 2999, 2301.] C. {w|w ends with an even nonzero number of O's} D. {w|w has at least 3 characters and the 3rd character is 0} E. {w |w neither contain two consecutive a's nor two consecutive b's } F. {w | w is any string except bb and bbb} G. Strings of alphabet {a, b, c} with odd number of a's followed by even number of b's. H. Student ID of BSCSE students of UIU from Spring 2017 till Spring 2019. Assume that UIU has only 300 I. students admitted in each trimester. Sample accepted strings: 011171001, 011182135, 011191300.

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Related questions

Q: Define the language of all positive integers (decimal and with no preceeding zeros) that are…

Q: (c) Write the paths representing parsing of the following input by the automato depicted below.…

A: As per our guidelines, we are supposed to answer one question and if subparts are available then 3…

Q: Give a DFA for each of the following sets of strings over the alphabet {a, b}. Be sure to indicate…

A: Deterministic Finite Automata (DFAs) are fundamental models in automata theory used to recognize…

Q: Define a Python 3 function shuffle_language (A, B) that returns the shuffle A||B of languages A and…

A: Coded using Python 3.

Q: ion that takes a sentence as input, performs lemmatization using StanfordNLP, and removes stopwords…

A: You can use NLTK to eliminate stopwords and the StanfordNLP package for lemmatization in order to…

Q: Write a short Python function, first_and_last(data),

A: Programming approach Here, we will use the bubble sort algorithm to sort the list of strings…

Q: Given R=(aa+b* + b+a*)* and S=(a*ba*b + ab*a)* a) Give an example of a string of length five that is…

A: Given, R=(aa+b* + b+a*)* and S=(a*ba*b + ab*a)* The R and S contain the combination of strings a and…

Q: Complete main() to read dates from input, one date per line. Each date's format must be as follows:…

A: The machine language code generated by the compiler might not be as short as written straightaway in…

Q: correct the syntax errors using System; class GFG { void KMPSearch(string pat, string txt)…

A: Correcting the C++ code for pattern searching

Q: Sorting su mxes : Let T be a string of characters T,T.…T 1. where T; denotes the i-th character…

A: The code is below using merge sort.

Q: a Python function called transl(d, s) which takes as input a Python dictionary d and a string of…

A: The complete code in Python is below:

Q: • frame: takes in a short sentence (string with words separated by spaces) and returns a string that…

A: Algorithm: Start Read a string s Implement a method frame() which takes string s as argument…

Q: Complete the function ratio_similarity, which computes the ratio of "similarity" between two…

A: Answer: We have done code in python in and attached code and output as well.

Q: Vhat is the orthogonal projection of v onto the vector û = -êg associated with the polar coordinates…

A: Answer:- 0.73513i + 0?4413j

Concept explainers

Use of XOR function

XOR function or exclusive OR function was introduced in Excel 2013. This function is available under excel logical functions. For the given statement, the XOR function will return true only when either of the statements is true. It returns false when both the statements are true or when both the statements are false.

Question

Write down Regular Expressions for the following languages.
A. Strings of alphabet {a, b, c} which contains ab and ac as substrings.
B. Strings of alphabet {0, 1, 2.9) which contains the odd years of 20th century. [Sample
Accepted Strings: 2001, 2999, 2301.]
C. {w|w ends with an even nonzero number of 0's}
D. {w|w has at least 3 characters and the 3rd character is 0}
E. {w |w neither contain two consecutive a's nor two consecutive b's }
F. {w | w is any string except bb and bbb }
G. Strings of alphabet {a, b, c} with odd number of a's followed by even number of b's.
H. Student ID of BSCSE students of UIU from Spring 2017 till Spring 2019. Assume that
UIU has only 300
I. students admitted in each trimester. Sample accepted strings: 011171001, 011182135,
011191300.

Expert Solution

This question has been solved!

Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.

This is a popular solution!

SEE SOLUTION Check out a sample Q&A here

Step 1

VIEW

Step 2

VIEW

Trending now

This is a popular solution!

Step by step

Solved in 2 steps with 1 images

SEE SOLUTION Check out a sample Q&A here

Knowledge Booster

Learn more about

Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.

Similar questions

Please IN C++ Write the simplest program that will demonstrate iteration vs recursion using the following guidelines - Write two primary helper functions - one iterative (IsArrayPrimeIter) and one recursive (IsArrayPrimeRecur) - each of which Takes an array of integers and its size as input params and returns a bool such that 'true' ==> all elements of the array are prime, so the array is prime, 'false' ==> at least one element in array is not prime, so array is not prime. Print out a message "Entering <function_name>" as the first executed statement of each function. Perform the code to test whether every element of the array is a Prime number. Print out a message "Leaving <function_name>" as the last executed statement before returning from the function. Remember - there will be nested loops for the iterative function and there can be no loops at all in the recursive function. For the recursive function - define one other helper function (IsPrimeRecur) which…
please do j, k, and l thanks in advanced
Implement a function that takes two strings of equal length and returns the distance between two strings is the number of positions at which the corresponding symbols are different.Check if thr given strings are of equal length, if not,return-1 PHYTHON LANGUAGE
Please help me fill in the blanks The reverse of a string x, denoted rev(x), is the string obtained by writing x backwards. For example, if x = abbaaab then rev(x) = baaabba. If A is a subset of Σ*, the reverse of A, denoted rev(A), is the subset of Σ* consisting of all reverses of strings in A: rev(A)={rev(x) | x∈A} For example, rev({a,ab,aab}) = {a,ba,baa}. Suppose you are given a deterministic finite automaton M accepting a set A. Show how to construct a DFA N accepting rev(A). (Kozen would suggest putting pebbles on the final states of M and moving them backwards along transition edges.) Describe N formally (i.e. in terms of Q, δ, etc.) including the definition of acceptance. Hint: the subset construction will be helpful here. You can start with M = (Q, Σ, δ, s, F) and define the components of N in terms of the components of M. 1. DFA N = (Q_N, Σ, δ_N, s_N, F_N) where Q_N = ___ 2. DFA N = (Q_N, Σ, δ_N, s_N, F_N) where δ_N = ___ 3. DFA N = (Q_N, Σ, δ_N, s_N, F_N)…
I want solution with step
Consider the following two sentences: S1:I like yellow roses better than red ones. S2:Looks like John is bettering the working conditions at his organization Create a Python function that encodes two sentences using the custom BPE tokenizer and identifies common subword tokens (tokens that appear in both encodings). Return a list of these common subword tokens. Is/Are there any interesting observations when you compare the tokens between the two encodings? What do you think is causing what you observe as part of your comparison?