COMP 540 - Automata, Computability and Formal Languages

(3 credits)
Prerequisite: Admission to the MS program in Computer Science or consent of instructor
Topics in this course will include finite automata and regular languages, context- free languages, Turing machines and their variants, partial recursive functions and grammars, Church’s thesis, undecidable problems, complexity of algorithms and completeness. Offered periodically.