Deterministic and non-deterministic finite automata, regular expressions and sets, context-free grammars and pushdown automata. Turing machines as acceptors, enumerators and computers. Church’s thesis, universal Turing machines and the halting problem, the Chomsky hierarchy and intractable problems.

Prerequisite(s): None.

Add to My Catalog (opens a new window)

Add to My Favorites (opens a new window)

Facebook this Page (opens a new window)

Tweet this Page (opens a new window)

Print (opens a new window)

Help (opens a new window)