Exercise 28:

Minimum DFA for {w{a,b}x,y:((w=xyy2˙)yb=1+ya)}\{ w \in \{a,b\}^* \mid \forall x,y: ((w=xy \wedge |y|\notin\dot{2}) \Rightarrow |y|_b=1+|y|_a) \}
Describe the minimum DFA that recognizes the words over {a,b}\{a,b\} whose suffixes of odd length have the propierty that their number of bb’s equals their number of aa’s plus 11.
Authors: Guillem Godoy / Documentation:
To be able to submit you need to either log in, register, or become a guest.