 |
| Topic |
Mod-01 Lec-07 A generalization of pumping lemma, nondeterministic finite automata (NFAs)
 |
| Lecture |
 |
| Notes |
|
| Topic |
Mod-01 Lec-08 Formal description of NFA, language accepted by NFA, such languages are also regular.
|
| Lecture |
|
| Notes |
|
| Topic |
Mod-01 Lec-09 'Guess and verify' paradigm for nondeterminism.
|
| Lecture |
|
| Notes |
 |
| Bookmarks |
0 Comments
Post a Comment