- Thread starter
- #1
- Apr 14, 2013
- 4,966
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 [tex] \approx_{L} [/tex] ?
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 [tex] \approx_{L} [/tex] ?
Also,which is the smallest(as for the number of states) deterministic automata
that recognize this language?