This site uses cookies only for the purpose of identifying user sessions.
This is required to properly register actions.
Minimum DFA for $\{ 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\}$ whose
suffixes of odd length have the propierty that their number of $b$’s equals
their number of $a$’s plus $1$.
Authors: Guillem Godoy
/
Documentation: