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; insolvability; halting problem; computational complexity; and recursive functions. The course also discusses issues in equivalence of various computational models, minimization, and chracterizations.
CSC 385: Theory of Computing
Program