Question: Construct a DFA that accepts set of all substrings over the alphabet $\sum={a,b}$ containing wither the substring aaa or bbb
0

Mumbai University > Information Technology > Sem 4 > Automata Theory

Marks: 5M

automata theory • 153 views
 modified 8 weeks ago by RB • 100 written 5 months ago by
0

- 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$