CS 476 Automata Theory and Formal Languages

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, NP-completeness. Credit units: 3 ECTS Credit units: 6, Prerequisite: CS 201.

Autumn Semester (Can Alkan)

  | Bilkent University Main Page |

  Last regenerated automatically on November 20, 2017 by OAC - Online Academic Catalog Software.