Bilkent University Logo

Bilkent University

Online Academic Catalog

Undergraduate and Graduate Programs 2018-2019


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: 5, Prerequisite: CS 201.

Autumn Semester (Hamdi Dibeklio─člu)

Bilkent University Main Page

Last regenerated automatically on August 16, 2019 by OAC - Online Academic Catalog Software