Automata

Section 3a: Automata

1. Alphabets, Strings, and Languages
2. Regular Languages
   1. Deterministic Finite Automata
   2. Nondeterministic Finite Automata
   3. Regular Expressions and operators
   4. Pumping Lemma for Regular Languages
3. Context-Free-Languages
   1. Grammars and Ambiguity (These examples show BNF, but BNF is equivalent to CFG.)
   2. Context-Free Grammars and Chomsky Normal Form
   3. Pushdown Automata
   4. Pumping Lemma for Context-Free Languages