Exercise 5:

Minimum DFA for {w{a,b}x:w=xbba}\{ w \in \{a,b\}^* \mid \exists x: w=xbba \}
Describe the minimum DFA that recognizes the words over {a,b}\{a,b\} ending with bbabba.
Authors: Guillem Godoy / Documentation:
To be able to submit you need to either log in, register, or become a guest.