Formal Languages and Automata

0.5 credits · Undergraduate

Formal languages and automata are the underlying theoretical foundations of computer science. Core topics include regular languages and finite automata, context-free languages and pushdown automata, the Turing machine and its languages. Real world applications, unsolvable problems, and their relevance to the semantics of programming are also discussed. Prerequisite: COIS 1020H. Recommended: COIS-MATH 2600H.