1
4.5kviews
Construct a DFA that accepts set of all substrings over the alphabet $\sum={a,b}$ containing wither the substring aaa or bbb
1 Answer
written 5.6 years ago by | modified 5.6 years ago by |
- | 0 | 1 |
---|---|---|
$\rightarrow$ $q_0$ | $q_1$ | $q_4$ |
$q_1$ | $q_2$ | $q_4$ |
$q_2$ | $q_3$ | $q_4$ |
$*q_3$ | $q_3$ | $q_3$ |
$q_4$ | $q_1$ | $q_5$ |
$q_5$ | $q_1$ | $q_6$ |
$*q_6$ | $q_6$ | $q_6$ |