15-453 Formal Languages, Automata, and Computation
Lecture 9: Regular Grammars

We continue our exploration of grammers by isolating a fragment which can easily be seen to be equivalent to non-deterministic finite automata. This leads us to the so-called left linear and right linear grammars.

[ Home | Schedule | Assignments | Handouts | Overview ]

Frank Pfenning