Exercise 29:

Minimum DFA for {w{a,b}y:((y=2yb>0)wy>0)}\{ w \in \{a,b\}^* \mid \forall y: ((|y|=2 \wedge |y|_b>0) \Rightarrow |w|_y>0) \}
Describe the minimum DFA that recognizes the words over {a,b}\{a,b\} that contain all possible subword of length 22 with at least one bb. Note that there are only three of such subwords (abab, baba, bbbb), but they might be overlapped.
Authors: Guillem Godoy / Documentation:
To be able to submit you need to either log in, register, or become a guest.