The product construction: regular languages are closed under Boolean operations. mod2 and mod3.
Sketch of proof by induction that the product automaton recogninzes the intersection of languages.
Thm: Regular languages closed under union, intersection, complement.
Nondeterministic finite automata. Formal definition, and informal concept. (labelled paths on directed graphs, pushing chips around.)