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.
Fall 2025
Instructors
Meeting Patterns
Classes Start:
August 18, 2025
Classes End:
December 2, 2025
Location:
01021 Engineering Building 2
Class Days:
M W
Class Start Time:
6:00pm
Class End Time:
7:15pm
Class Type:
Lecture
Credits:
3.00
Restrictions:
Prerequisite: Grade of C or better in either MA 225 or CSC 226 Computer Science Majors
