COMP 481: AUTOMATA/FORMAL LANG/COMPUTING
Fall 2026 · Section 001 · CRN 12688
Finite automata, regular expressions, regular languages, pushdown automata, context-free languages, Turing machines, recursive languages, computability, and solvability. It is strongly recommended that students complete three semesters of Mathematics before enrolling in this course. Graduate/Undergraduate Equivalency: COMP 581 . Mutually Exclusive: Cannot register for COMP 481 if student has credit for COMP 581 .
- Credits
- 3
- Instructors
- Ron Goldman