Finite state automata and regular expressions. Context-free grammars and pushdown automata. Turing machines. Models of computable functions and undecidable problems. The course emphasis is on the theory of computability, especially on showing limits on computation. May be taken for graduate credit. (Same as MATH 510.)
Prerequisite(s): EECS 210 and upper-level EECS eligibility
Back to previous page
