in Theory of Computation edited by
3,032 views
0 votes
0 votes
Give DFA's accepting the following languages over the alpabet $\{0,1\}:$

$a)$ The set of all strings ending in $00.$

$b)$ The set of all strings with three consecutive $0's$ (not necessarily at the end)$.$

$c)$ The set of strings with $011$ as a substring.
in Theory of Computation edited by
by
3.0k views

1 Answer

0 votes
0 votes

.......

1 comment

c]011 as substring 

 

0
0