Exercise 39:

Minimum DFA for {xy{a,b}xaa=yb}\{ xy \in \{a,b\}^* \mid |x|_{aa}=|y|_b \}
Describe the minimum DFA that recognizes the words over {a,b}\{a,b\} that can be divided into two parts such that the number of subwords aaaa of the first part equals to the number of bb’s of the second part.
Authors: Guillem Godoy / Documentation:
To be able to submit you need to either log in, register, or become a guest.