 |
| Topic |
Mod-01 Lec-22 Parse trees, inductive proof that L is L(G). All regular languages are context free.
 |
| Lecture |
 |
| Notes |
|
| Topic |
Mod-01 Lec-23 Towards Chomsky normal forms: elimination of useless symbols
|
| Lecture |
|
| Notes |
|
| Topic |
Mod-01 Lec-24 Simplification of cfgs continued, Removal of epsilon productions
|
| Lecture |
|
| Notes |
 |
| Bookmarks |
0 Comments
Post a Comment