Back to Coursework

CSCI 561 - Theory of Computation

Fall 2018 at Mines

An introduction to abstract models of computation and computability theory; including finite automata (finite state machines), pushdown automata, and Turing machines. Language models, including formal languages, regular expressions, and grammars. Decidability and undecidability of computational problems.