CSCI 291Theory of Computation

Catalog

This course presents formal models of computation such as finite state automata, pushdown automata, and Turing machines will be studied, along with the corresponding elements of formal languages (including regular expressions, context-free languages, and recursively enumerable languages). These models will provide a mathematical basis for the study of complexity classes, computability, and undecidability.