TOC MID

1. Regular Languages

1.1. Finite Automata

1.1.1. Formal definition of a finite automaton

1.1.2. Examples of finite automata

1.1.3. Designing finite automata

1.2. Nondeterminism

1.2.1. Equivalence of NFAs and DFAs

1.2.2. Closure under the regular operations

1.3. Regular Expressions

1.3.1. Equivalence with finite automata

1.4. Nonregular Languages

1.4.1. The pumping lemma for regular languages