What is the regular language of the following example:
S-> aT | bS | lambda
T-> bA | aT | lambda
A-> bS | lambda
Thanks.
What is the regular language of the following example:
S-> aT | bS | lambda
T-> bA | aT | lambda
A-> bS | lambda
Thanks.
Copyright © 2021 JogjaFile Inc.
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)$.