CSE 625 : Automata and Formal Langurages

Spring 2008

MWF: 11:30 am - 12:18 pm
DL 0266



Instructor   /   Grader:

   

Course Description

     
    This course introduces students to the theory of computation via formal languages and models of computation. It focuses on regular languages and contex-free languages. In particular, topics include regular language/expression, deterministic and non-deterministic finite automata, the Pumping Lemma for non-regular languages, context-free languages and pushdown automata.

 
   

Textbook   /   Grading

 Introduction to Languages and the Theory of Computation by J. Martin. 3rd Ed.,  McGraw-Hill book company, 2003    

Assignments:   30%,    Midterm:   30%,    Final:   40%
   

Course Materials


   

Announcements: