
Announcements 


Description  Finite automata, regular expressions, regular languages and their properties, the pumping lemma. Context free grammars and languages, normal forms, pushdown automata, the pumping lemma for the CFLs. Turing machines and their properties. Decidability and undecidable languages. Complexity theory, NPcompleteness. Credit units: 3 ECTS Credit units: 6, Prerequisite: CS 201.  
Textbook  Introduction to the Theory of Computation , 3rd Edition, Cengage Learning, Micheal Sipser  
Outline 


Grading 


Remarks 