CS 6170 - Automata and Formal Languages

Units: 4
Alphabets, strings and languages; Chomsky hierarchy and language classes; regular languages, finite automata, regular expressions and operators; context-free languages, grammars, pushdown automata; context-sensitive languages; Turing machines and decidability. Prerequisites: MATH 2101, MATH 2150, MATH 2304