Course Description
Study of three classical formal models of computation--finite state machines, context-free grammars, and Turing machines--and the corresponding families of formal languages. Power and limitations of each model. Parsing. Non-determinism. The Halting Problem and undecidability. The classes P and NP, and NP-completeness.
Spring 2026
Instructors
Meeting Patterns
Classes Start:
January 12, 2026
Classes End:
April 28, 2026
Location:
01021 Engineering Building 2
Class Days:
T H
Class Start Time:
8:30am
Class End Time:
9:45am
Class Type:
Lecture
Credits:
3.00
Restrictions:
Prerequisite: Grade of C or better in either MA 225 or CSC 226 Computer Science Majors