COMP 385 - Theory of Computing

When Offered: F, S

3 Credit(s)
3 Lecture Hour(s)
0 Lab Hour(s)

This course is the study of topics which include theory of finite state machine and automata; regular expressions; Turing machines; grammars; parsing; language hierarchy; machine design and construction; computability; unsolvability; halting problem; computational complexity; and recursive functions. The course also discusses issues in equivalence of various computational models, minimization, and characterizations.

Prerequisite(s): COMP 360.