| |
Dec 22, 2025
|
|
|
|
|
2014-2015 Undergraduate Catalog ARCHIVED CATALOG: CONTENT MAY NOT BE CURRENT. USE THE DROP DOWN ABOVE TO ACCESS THE CURRENT 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 .
Notes This course is crosslisted with CS 656. Credit at the 600-level requires additional work.
|
|