Automata & Formal Languages CMSC 451 Mark E Woodcock Spring 1998 859-6483 (work) TR 7:00-8:15 ECS 215, x3554 SS 108 OH: After class http://www.cs.umbc.edu/~woodcock/ Tuesday Thursday January 27 Admin/ Cantor 29 Finite Automata February 3 DFA,NFA 5 e-moves 10 equivalence 12 reg expr 17 applications 19 output/variations 24 Pumping Lemma 26 Closure March 3 Decision Props 5 TEST I 10 CFG's 12 Derivations 17 Simplifications 19 Normal Forms 24 SPRING BREAK SPRING BREAK SPRING BREAK 31 Ambiguity April 2 PDAs (DROP WEEKEND) 7 Equiv w/CFLs 9 Pumping II 14 Closure 16 Decision Props 21 TEST II 23 TMs 28 integer comp 30 Church May 5 Recursive & RE 7 Halting Prob 12 Properties of Rec & RE EXAMS Exams will be comprehensive and closed-book. Midterm exams will be held during regular class time. The final exam will be held, as scheduled by the registrar, from 8:30-10:30 on Tuesday, May 19, 1998. HOMEWORK There will be several homeworks, primarily problems from the book, during the semester. 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 (total) 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). GRADER Jiefeng (Jenny) LI jieli@gl.umbc.edu OH: T 4:45-5:45 ECS 231