Automata & Formal Languages
	            CMSC 451 	 	Mark E Woodcock
		    Winter 1996		859-6324 (work)
		    TWR 6:00-9:10	ECS 233B, x2587
		    SS 204		OH:  After class
			     
			     
	Tuesday	           Wednesday		 Thursday		
January
2 Intro/Admin 		3 DFA, NFA		4 regular expr
  Cantor's Paradox	  e-moves                 applications
  Finite Automata         equivalence             output/variations

9  Pumping Lemma	10 TEST1		11 Simplifications
   Closure                 CFG's		   Normal Forms
   Decision Props          Derivations		   Ambiguity


16 PDAs 		17  Pumping II		18 TEST2
   Equiv w/CFL's            Closure                TMs
			    Decision Props

23 Integer Computation  24  Recursive & RE's	25  FINAL EXAM
   variations               Halting problem
   Church

EXAMS	 
Exams will be comprehensive and closed-book.  All exams will be
held during regular class time.  The final exam will be held
Thursday January 25, 1996.

HOMEWORK 
There will be several homeworks, primarily problems from the book, during 
the semester.  Due to the short length of the winter session, there will
be a minimal amount of time allocated for each: DON'T FALL BEHIND, it
could be costly.  Homeworks will be weighted according to their difficulty
and importance.  You may discuss assignments with others, but you are
only permitted to hand-in individual effort (e.g. solutions, programs).

GRADES	
Course grades will generally be determined using the following
components and weights:

	Midterm		15 (each)
	Homework	30
	Final Exam	40 

While a normal (boring) Bell Curve is expected, the instructor
reserves the right to construct one, to consider class participation,
relative improvement, to give all A's or flunk the whole class (where
appropriate).

CONTACTING THE INSTRUCTOR
I will be working full-time all semester, so the best time to catch
me will directly before or after class.  If you wish to set up some 
time to see me, call me at work, leave a message with the department or
send me e-mail (woodcock@cs.umbc.edu).