Automata & Formal Languages
Prerequisites: MATH 201 or MATH 212 or COMP 163.
This course introduces formal language theory, including such topics as finite automata and regular expressions, pushdown automata and context-free grammars, Turing machines, undecidability, and the halting problem.
Outcomes: An understanding of the theoretical underpinnings of computability and complexity in computer science.
This course introduces formal language theory, including such topics as finite automata and regular expressions, pushdown automata and context-free grammars, Turing machines, undecidability, and the halting problem.
Outcomes: An understanding of the theoretical underpinnings of computability and complexity in computer science.