Lecture 2, Sept. 25, 2001.

Done in class:

(1) regular operations: union, concatenation, star

(2) closure of regular languages under union/intersection

(3) nondeterministic finite automata (nfa): examples and definition

(4) equivalence between deterministic and nondeterministic 
	finite automata


We covered most of Sec. 1.2 (up to p. 58).