CPTR 442 Theory of Computation View in Kuali Update Delete Update Rules PDF


Catalog 1999 — Indefinite    

Description

Formal models of computation such as finite state automata, push-down automata and Turing machines. Formal languages. Computability and complexity theory along with the practical implications of theoretical results.

Credits

3

Terms Offered

VARIABLE

Prerequisites