Theory of Computation - Page 8

Topic
Design DFA for L= a^m b^n c^p / m,n,p is greater than or equal to 0 | DFA Design | TOC | Automata
Lecture
Notes
Topic
DFA which accepts strings of form a^3bwa^3 , where 'w' is any string| DFA design |TOC | Automata
Lecture
Notes
Topic
Design DFA for strings that every a is immediately preceded and followed by b | GATECSE | TOC
Lecture
Notes
Bookmarks

0 Comments

Post a Comment