AUTOMATA, FORMAL LANGUAGES, AND COMPUTABILITY
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 .
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 Undergraduate, Undergraduate Professional or Visiting Undergraduate level students. Course Level: Undergraduate Upper-Level Prerequisite(s): ( COMP 382 or MATH 306 or MATH 356 )
Sources
- Course catalogue ↗2026–2027