Go over the old quiz.
	Students aren't responsible for splay trees, but it should be
	clear that all but two of the possible answers can't be
	true. (I guess you have to know that splaying at a node brings
	it to the root)

Do some FA examples.  
	E.g., build a FA to recognize your name in any string.
	build an FA to recognize even binary numbers

Define accepting state and start state.