COMP 581

AUTOMATA, FORMAL LANGUAGES, AND COMPUTABILITY

Credit Hours: 3 · Graduate

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 481 . Mutually Exclusive: Cannot register for COMP 581 if student has credit for COMP 481 .

Prerequisites & course information

Short Title: AUTOMATA/FORMAL LANG/COMPUTING Department: Computer Science Grade Mode: Standard Letter Course Type: Lecture Credit Hours: 3 Restrictions: Enrollment is limited to Graduate level students. Course Level: Graduate

Sources

Course catalogue ↗2026–2027