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,z: ((w=xyz \wedge |y|=3) \Rightarrow |y|_a=2) \}$

Describe the minimum DFA that recognizes the words over $\{a,b\}$ such that
every subword with length $3$ has exactly two $a$’s.

Authors: Guillem Godoy
/

Documentation: