CSCE 422/4201 - Theory of Computing (3 cr.)

Prerequisites

and Senior standing.

Description
Finite automata and regular expressions, context-free grammars and push-down automata, nondeterminism. Context-sensitive grammars and the Chomsky hierarchy of grammars. Turing machine and the halting problem. Undecidable problems. Church’s Conjecture and its implications.

When Offered
Offered in fall and spring.