contestada

Consider the following regular expression, where 'a' and 'b' are the only letters in the language generated:
b* a b* a(a + b)*
For example, this can generate the word: bbabbbabbaa since the first b* can be used to generate two b's followed, then an 'a', followed by three b's in the second b* followed by an 'a', then (a b)* can be used to generated a 'b', 'b', 'a', and an 'a'.
What is the most interesting thing about the language generated by this grammar (one English sentence)?

Respuesta :

ammary456

Answer:

It will always contain aa as the substring .

Explanation:

The grammar generates the language that always contains aa as the substring .

As the given grammar is: b*ab*a(a+b)*

The language which it generates is:

L = { aa , baa , aba , baba , babaa , babab , baab , baaa , abab , abaa ...... }

If we see the above, then every language that is generated by this grammar will surely contain aa (double a) as a substring.

Otras preguntas