F09_CSE309+Theory+of+Automata

=**CSE309: Theory of Automata**= Instructor: Abdul Wajed Prerequisites: CSE141 and MTS201

**Course Description**
This course introduces the fundamentals of Programming Language Theory, Regular Expressions, and Grammars. Deterministic and non-deterministic automata, their limitations and alternates like pushdown automata. Different computing models are also discussed such as Automata and Turing Machines with emphasis on their applicability to problem domains. Equivalence of the computing models is also introduced and Church’s the also introduced along with fundamental concepts of computability theory.

Outline

 * 1) Languages
 * 2) Recursion and Recursive Definitions
 * 3) Regular Expressions
 * 4) Finite Automata
 * 5) Closures and Kleen’s Theorem
 * 6) Regular Languages
 * 7) Context Free Grammars
 * 8) Pushdown Automata
 * 9) Turing Machines
 * 10) Introduction to Computability Theory

Required Books
Introduction to Computer Theory, by Daniel I. Cohen, John Wiley & Sons

Reference Books
Introduction to Automata Theory, Languages and Computation, by John E. Hopcroft, Jeffery D. Ullman Introduction to Languages and Theory of Comutation by John C. Martin

Grading Policy
The grade will be determined as described below. No bonus work, make-up work, dropped scores, or other means of raising your grade should be expected. Hourly Exam 30% Final Exam 40% Quizzes & Assignments 20% Presentaion and term report 10%