Theory Of Computation-DFA Design
Pages
Home
About Me
Saturday, August 10, 2013
Design DFA for the following language over {0,1}
Draw a finite automata
2nd symbol as 0
4th symbol as 1
and '4 letters'
Possibilities:
(0/1)0(0/1)1
0001
0011
1001
1011
No comments:
Post a Comment
Older Post
Home
Subscribe to:
Post Comments (Atom)
No comments:
Post a Comment