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 |w|_a\in\dot{2}\wedge |w|_b\in\dot{2} \}$

Describe the minimum DFA that recognizes the language of words over $\{a,b\}$
with an even number of $a$’s, and an even number of $b$’s.

Authors: Guillem Godoy
/

Documentation: