mathmari
Gold Member
MHB
- 4,984
- 7
Hello!
I need some help at the following exercise:
The language L={l ε {a,b}*:the word l does not contain the subword bba} is regular.Which are the equivalence classes of the relation \approx_{L} ?
Also,which is the smallest(as for the number of states) deterministic automata
that recognize this language?
I need some help at the following exercise:
The language L={l ε {a,b}*:the word l does not contain the subword bba} is regular.Which are the equivalence classes of the relation \approx_{L} ?
Also,which is the smallest(as for the number of states) deterministic automata
that recognize this language?