Exercise 12:

Minimum DFA for {w{a,b}x,y,z:((w=xyzy=3)(ya2˙yb2˙))}\{ w \in \{a,b\}^* \mid \forall x,y,z: ( (w=xyz \wedge |y|=3) \Rightarrow (|y|_a\in\dot{2} \vee |y|_b\notin\dot{2}) ) \}
Describe the minimum DFA that recognizes the language of the words over {a,b}\{a,b\} whose subwords of length 33 have an even number of aa’s or an odd number of bb’s.
Authors: Guillem Godoy / Documentation:
To be able to submit you need to either log in, register, or become a guest.