 |
| Topic |
DFA that accepts strings containing "ab" as a substring | DFA Design| TOC | Automata Theory
 |
| Lecture |
 |
| Notes |
|
| Topic |
Design a DFA in which set of all strings can be accepted which ends with ab | TOC | Automata Theory
|
| Lecture |
|
| Notes |
|
| Topic |
DFA of language with all strings starting with 'a' and ending with 'b' | TOC | GATECS
|
| Lecture |
|
| Notes |
 |
| Bookmarks |
0 Comments
Post a Comment