Course Description
Formal models of language and computation; finite automata and regular languages, pushdown automata and context-free languages, Turing machines. Relative power of models, Chomsky hierarchy. Inherent complexity of problems: undecidability, computational complexity, intractable problems.
Spring 2026
Instructors
Meeting Patterns
Classes Start:
January 12, 2026
Classes End:
April 28, 2026
Location:
02236 Engineering Building 3
Class Days:
M W
Class Start Time:
3:00pm
Class End Time:
4:15pm
Class Type:
Lecture
Credits:
3.00
Restrictions:
Restriction: CSC Grads, 14DSFCTG, 14DSFZCTG, 14CSCCTG, 14CSCZCTG, 14CNCMS, 14CYSMS, and CN Grads