S11_CSE309_Theory_of_Automata

=CSE309: Theory of Automata= =Program:= BS(CS)

Semester:
Spring 2011

Instructor:
Abdul Wajed

**Course Lead:**
Abdul Wajed

**Credit Hours:**
3

Prerequisite(s):
CSE141, CSE142, CSE(algo)

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

Course Objectives:
One para description of the Course objectives.

URLs (Optional):
If you have any additional course website/facebook/twitter/etc.

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

by John E. Hopcroft, Jeffery D. Ullman
 * Reference BooksIntroduction to Automata Theory, Languages and Computation**,

by John C. Martin
 * Introduction to Languages and Theory of Comutation**

Web Resources:
Any web resources that may be used during the course.

Grading Policy:
Mid Term Exam = 30% + 30% Final Exam = 40%

Uploaded Reference Course Outline:
You may also upload a course outline here.

Class Time Spent On (In Credit Hours):
Theory: 2.5 Problem Analysis: 0.5 Solution Design: 0.5 Social and Ethical Issues: 0.5


 * 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