Automata Theory & Formal Languages

Theory of mathematical models of computing devices through the study of abstract machines and corresponding formal languages. Topics include: formal languages, grammars, finite state machines, regular sets, regular expressions, limitations of finite state models, pushdown automata, context free languages, Turing machines, effective computability, unsolvable decision problems.