Theory of Computation

3 credits · Undergraduate

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. PREREQUISITES: (CSCI 1315.03 or CSCI 2112.03) and (CSCI 2115.03 or CSCI 3136.03), each with a grade of C or better. CROSSLISTED: MATH 4660.03