Lecture 1, Sept. 20, 2001.

Done in class:

(1) course outline/administrative details (see the handout available
in ps and pdf)

(2) examples of finite automata 

(3) formal definitions of 

	finite automaton (fa),

	a string accepted by a fa,

	a language accepted by a fa,

	a regular language.

(4) an example of designing a fa for a given regular language 
    ( L = { w | w is a binary string containing at least one 0 } )

Reading assignment: 

	Chaps. 0 and 1. 

In class, we covered most of Section 1.1 of the text (up to p. 44, The
Regular Operations).