Lecture 7 Slides (Regular Expression-Automata Conversion)

This lecture is about two important conversions: from regular expressions to non-deterministic finite automata (NFA) and from NFA to DFA.

• Tiger Book Chapter 2 (Specifically 2.4)