Finding the regular language of the following expressions

44 Views Asked by At

What is the regular language of the following example:

S-> aT | bS | lambda T-> bA | aT | lambda A-> bS | lambda

Thanks.

1

There are 1 best solutions below

1
On BEST ANSWER

The deterministic automaton associated to this grammar is represented below. It is not difficult now to see that the language accepted by this automaton is $(aa^*b^2 + b)^*(a^* + a^+b)$.

enter image description here