Automata Theory (CMSE471)
Introduction to formal languages and grammars. Deterministic and non-deterministic finite automata. Regular languages. Regular expressions. Limitations of languages. Context-free grammars. Context-free languages. Pushdown automata. Parsing. Chomsky hierarchy. Unrestricted grammars. Recursive and recursively enumerable sets. Turing machines. Computability.