COMP 330 — Theory of Computation

Finite automata, regular languages, context-free languages, push-down automata, models of computation, computability theory, undecidability, reduction techniques.

• Rating: 4.00 out of 5 from 649 student reviews
• Difficulty: 3.47 out of 5
• Credits: 3
• Faculty: Faculty of Science
• Department: Computer Science
• Taught by: Jérôme Waldispuhl
• Prerequisite: COMP 251.

Sections offered

• Section 001 (Lec), Tue Thu 2:35-3:55 pm — 11 seats open