Exercise 19:

Minimum DFA for {w{a,b,c}x,y,z:(w=xbybzya2)}\{ w \in \{a,b,c\}^* \mid \forall x,y,z: (w=xbybz \Rightarrow |y|_a\geq 2) \}
Describe the minimum DFA that recognizes the words over {a,b,c}\{a,b,c\} such that between every two occurrences of bb there are at least two occurrences of aa.
Authors: Guillem Godoy / Documentation:
To be able to submit you need to either log in, register, or become a guest.