Computer Engineering Department / Boğaziçi University

Formal Languages And Automata Theory

Description: Strings and languages. Classification of grammars. Finite-state automata and regular expressions. Pushdown automata and context-free grammars. Context sensitive grammars and linear bounded automata. Turing machines.

Prerequisite: CMPE 220

Common Course Material

Course Offerings:

Spring 2009	A. C. Cem Say
Spring 2008	A. C. Cem Say
Spring 2007	A. C. Cem Say
Spring 2006	A. C. Cem Say
Summer 2005	A. C. Cem Say
Spring 2005	A. C. Cem Say
Summer 2004	A. C. Cem Say
Spring 2004	A. C. Cem Say
Summer 2003	A. C. Cem Say
Spring 2003	A. C. Cem Say
Spring 2002	A. C. Cem Say
Spring 2001	A. C. Cem Say
Spring 2000	A. C. Cem Say
Spring 1999	A. C. Cem Say