Catalog 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.
Credits:
(3+0+0) 3 ECTS 5
Prerequisites:
CmpE 220
| Offering | Course Page | Instructor |
|---|---|---|
| CmpE 350 Formal Languages and Automata Theory 2018 Spring | A. C. Cem Say | |
| CmpE 350 Formal Languages and Automata Theory 2018 Summer | A. C. Cem Say | |
| CmpE 350 Formal Languages and Automata Theory 2017 Spring | A. C. Cem Say | |
| CmpE 350 Formal Languages and Automata Theory 2016 Spring | A. C. Cem Say | |
| CmpE 350 Formal Languages and Automata Theory 2015 Spring | A. C. Cem Say | |
| CmpE 350 Formal Languages and Automata Theory 2014 Spring | Course Page | A. C. Cem Say |
| CmpE 350 Formal Languages and Automata Theory 2014 Summer | A. C. Cem Say | |
| CmpE 350 Formal Languages and Automata Theory 2013 Spring | Course Page | A. C. Cem Say |
| CmpE 350 Formal Languages and Automata Theory 2012 Spring | Course Page | A. C. Cem Say |
| CmpE 350 Formal Languages and Automata Theory 2011 Spring | Course Page | A. C. Cem Say |
| CmpE 350 Formal Languages and Automata Theory 2010 Spring | Course Page | A. C. Cem Say |
| CmpE 350 Formal Languages and Automata Theory 2010 Summer | Course Page | A. C. Cem Say |