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 2025
Instructors
Meeting Patterns
Classes Start:
January 6, 2025
Classes End:
April 22, 2025
Location:
01220 Engineering Building 2
Class Days:
M W
Class Start Time:
11:45am
Class End Time:
1:00pm
Class Type:
Lecture
Credits:
3.00
Restrictions:
Restriction: CSC Grads, 14DSFCTG, 14DSFZCTG, 14CSCCTG, 14CSCZCTG, 14CNCMS, and CN Grads
