| |
Apr 05, 2026
|
|
|
|
|
2025-2026 Undergraduate Catalog
|
CS 456 - Automata and Formal Languages
Regular expressions. Regular, context-free, and unrestricted grammars. Finite and pushdown autoamata. Turing machines and the halting problem; introduction to decidability.
Credits: 3
Prerequisites: and MATH 251 . Prerequisites must be completed with a grade of C or better. The maximum number of attempts for this course is three, including earned grades, withdrawals, and audits.
Notes: This course is crosslisted with CS 656. Credit at the 600-level requires additional work.
|
|