Computation Theory
CS 0170
Course Description
Models of computation: Turing machines, pushdown automata, and finite automata. Grammars and formal languages, including context-free languages and regular sets. Important problems, including the halting problem and language equivalence theorems.
Basic Enrollment Requirements:
Academic Year (Fall/Spring): Unofficial Transcript – Bachelor’s Degree or progress towards a Bachelor’s Degree + 3.0 GPA.
Summer Session: None.
Refund Policy: The refund policy for Courses at Tufts offerings is dependent on the course length. Please refer to the section details to confirm any exceptions to the standard refund policy. The refund policies are viewable here: https://universitycollege.tufts.edu/policies#Refunds
Remission Eligible: Yes; all university policies apply.
Affiliated With:
- School of Engineering