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 |x|\geq 3) \Rightarrow (|x|_a\in\dot{2}\vee |x|_b\notin\dot{2}) ) \}$
Describe the minimum DFA that recognizes the language of the words over
$\{a,b\}$ such that every prefix of length greater than or equal to $3$ has
an even number of $a$’s or an odd number of $b$’s.
Authors: Guillem Godoy
/
Documentation: