L = {w|w contains the substring bab} give the regular expression that describes L are the...

Question

Question

L = {w|w contains the substring bab}

give the regular expression that describes L

are the 2 languages L and L* the same language?

Is L(aba)* a regular language?

engineering Computer-Science

Answer 1

Answer #1

a) Regular expression is:(a+b)*bab(a+b)*

b) Regular languages are closed under closure, hence L and L* are same language

c) Yes,L(aba)* is a regular language which can be represented as below finite automata:

Answer 2

Similar Homework Help Questions

Construct a regular expression that defines the language L (say) containing all the words with either...

Construct a regular expression that defines the language L (say) containing all the words with either exactly one aba-substring or exactly one bab-substring but not both aba- and bab-substrings. (Hint: For example, the word abab does not belong to L.)
given ∑ = {a,b}: 1. describe in English the languages denoted by the regular expression: (a+b)*b(a+b)*...

given ∑ = {a,b}: 1. describe in English the languages denoted by the regular expression: (a+b)*b(a+b)* 2. Write a regular expression: L(w) = {w | w has exactly a single substring abaa or exactly a single substring babb} 3. Write a regular expression for the following language: L(w) = {w | w ends in bb and does contain the substring aba}
For a regular language below, write an equivalent regular expression and draw an FA that accepts...

For a regular language below, write an equivalent regular expression and draw an FA that accepts the language. L = {w ∈ {a,b}*:w contains the substring aba}

Give a regular expression for the language of strings over {a,b} in which each substring of...

Give a regular expression for the language of strings over {a,b} in which each substring of length 2 contains two distinct characters
Give regular expressions for the following languages: (a) The language of all strings over {a,b} except...

Give regular expressions for the following languages: (a) The language of all strings over {a,b} except the empty string. (b) The language of all strings over {a,b} that contain both bab and bba as substrings. (c)L k = {w ∈ {a,b} * | w contains a substring having 3 more b’s than a’s}. (d) The language of all strings over {a,b} that have a b in every odd position (first symbol is considered position 1; empty string should be accepted)...
Give a regular expression for each of the following languages. e. {axb | x∈{a, b}*} f....

Give a regular expression for each of the following languages. e. {axb | x∈{a, b}*} f. {(ab)n } g. {x ∈ {a, b}* | x contains at least three consecutive as} h. {x ∈ {a, b}* | the substring bab occurs somewhere in x} i. {x ∈ {a, b}* | x starts with at least three consecutive as}

Let L = { w∈ {a, b}∗|w has even length and contains the substring aba }...

Let L = { w∈ {a, b}∗|w has even length and contains the substring aba } Design NFA.
Give the regular expressions of the following languages (alphabet is ab): a. {w | w has...

Give the regular expressions of the following languages (alphabet is ab): a. {w | w has a length of at least three and its second symbol is a b} b. {w | w begins with an a and ends with a b} c. {w | w contains a single b} d. {w | w contains at least three a's} e. {w | w contains the substring baba} d. {w | w is a string of even length} e. The empty...
Write a legal regular expression for the following regular language. L = { w | w...

Write a legal regular expression for the following regular language. L = { w | w ∊ (0 + 1)* and w contains an even number of 1’s AND an even number of 0’s}.

Give cfg for the following language over {0,1} {w | w contains the substring 011}

Give cfg for the following language over {0,1} {w | w contains the substring 011}