1. Saeid Pashzadeh Jan 2009 Theory of Computation 1

2. Introducing Saeid Pashazadeh  Affiliation: IT department Electrical and computer engineering faculty Tabriz University  Email:  Pashazadeh@tabrizu.ac.ir Pashazadeh@tabrizu.ac.ir  Pashazadeh@iust.ac.ir Pashazadeh@iust.ac.ir  URL:  http://pashazadeh.110mb.com http://pashazadeh.110mb.com  http://asatid.tabrizu.ac.ir/home.aspx?UserID=177 http://asatid.tabrizu.ac.ir/home.aspx?UserID=177 2

3. Logistics  Available on the web  References  Evaluation  Lecture Notes  Assignments  Arrangements and schedule  Exam Questions and answers  Grades  Projects  Notes 3

4. References  Text Books  1. Peter Linz, “Introduction to Formal Languages and Automata”, Fourth Edition, Jones and Bartlett publishers, Massachusetts, 2008. ISBN-13: 978-0-7637-3798-6, ISBN-10: 0-7637-3798-4.  2. S. P. Eugene Xavier, “Theory of Automata, Formal Languages, and Computation”, New Age International Publishers, New Delhi, 2005, ISBN-13: 978-81-224-2334-1, ISBN-10: 81-224-2334-5.  References  1. J. E. Hopcroft, J. D. Ulman, “Introduction of automata Theory, Languages and Computation”, Student Edition, Norasa, 1979.  2. Zohar Manna, “Mathematical Theory of Computation”, McGraw- Hill, 2000. 4

5. Course Description  Introduction to the classical and contemporary theory of computation covering regular, context-free, and computable (recursive) languages with finite state machines, pushdown automata, and Turing machines. Basic concepts of computability theory, complexity theory, and NP-theory. 5

6. Course Material  PART– I  Review of basic concepts: Graphs, Trees, Strings, Mathematical Induction, finite State Machine, types of languages and Grammars.  Regular Language, Regular Expression, Regular Grammar, Right and Left Linear Grammar, Closure property of Regular Languages, Pumping Lemma, Properties of Regular expressions, DFA, NFA and their equivalence, Moore’s and Mealy machine and their equivalence. identifying non regular languages, reduction of number of states, equivalence between regular language and regular grammars.  PART– II  Context free Language and Grammar, derivation tree, left most and right most derivation, Parsing and ambiguity, Chomsky and Greibach Normal Form, Pumping Lemma, Properties of CFL including closure property, PDA, NPDA as recognizer of CFL. 6

7. Course Material (cont)  PART – III  Context sensitive language and grammars, matrix Grammar, Markov algorithm, Recursive and recursively enumerable languages, recursive functions, ackerman’s functions.  PART – IV  Turing machine and thesis, Non Deterministic Turing Machine, Universal Turing Machine, computability and Decidability, Undecidable Problems: Halting Problem of TM, Post correspondence problem, undecidable problems of CFL, Post Systems. Computational Complexity, complexity classes and introduction to P, NP and NP complete. 7

8. Evaluation  Midterm (25%)  Final term (50%)  Three Quiz (15%)  Homework (10%) All exams and quizzes are closed book 8