CSE 103 — Theory of Computation Notes Finite Automata & Regular Expressions Nondeterminism, Closure Properties, Conversion of Regular Expressions to FA Pushdown Automata, Conversion of CFG to PDA and Reverse Conversion Key Concepts empty string empty language language string