Exercise ‹10›:

Minimum DFA for {w∈{a,b}∗∣∀x,y:((w=xy∧∣x∣≥3)⇒(∣x∣a∈2˙∨∣x∣b∈2˙))}\{ w \in \{a,b\}^* \mid \forall x,y: ( (w=xy \wedge |x|\geq 3) \Rightarrow (|x|_a\in\dot{2}\vee |x|_b\in\dot{2}) ) \}
Describe the minimum DFA that recognizes the language of the words over {a,b}\{a,b\} such that every prefix of length greater than or equal to 33 has an even number of aa’s or an even number of bb’s.
Authors: Guillem Godoy / Documentation:
To be able to submit you need to either log in, register, or become a guest.