Theory of Computation

3 credits · Graduate

This is a course on formal languages and computational models. Topics covered include finite automata, pushdown automata, Turing machines, undecidability and recursive and recursively enumerable functions. Some applications to computer science are also discussed such as compiler design and text processing. CROSSLISTED: MATH 4660.03, CSCI 4112.03