COM SCI 181
Theory of Computing
Computer Science · 4 units · Undergraduate upper division (100-199)
Designed for junior/senior Computer Science majors. Finite state machines, context-free languages, and pushdown automata. Closure properties and pumping lemmas. Turing machines, undecidability. Introduction to computability.
Letter grading.
Requisites
Official UCLA wording
Enforced requisite: course 180.
BruinTree reads · Prerequisite
confidence 1.00 · from UCLA’s structured dataRequires
Everything that has to come before this course, not just the courses named in the requisite above.
COM SCI 181
- COM SCI 180Introduction to Algorithms and Complexity
- COM SCI 32Introduction to Computer Science II
- COM SCI 31Introduction to Computer Science I
- MATH 61Introduction to Discrete Structures
- MATH 31BIntegration and Infinite Series
1 direct requisite. Showing 6 courses over 3 levels; the branches marked with a count carry on past it. Every course here opens its own tree.
Unlocks
What this course is a requisite for, and what those courses lead to in turn.
COM SCI 181
- COM SCI 234Computer-Aided Verification
- COM SCI 246Web Information Management
- COM SCI 281AComputability and Complexity
- COM SCI 288SSeminar: Theoretical Computer Science
- COM SCI 284ATopics in Automata and Languages