Exercise 3:

Minimum DFA for {w{a,b}wa2˙wb2˙}\{ w \in \{a,b\}^* \mid |w|_a\notin\dot{2}\vee |w|_b\notin\dot{2} \}
Describe the minimum DFA that recognizes the language of words over {a,b}\{a,b\} with an odd 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.