|
May 19, 2024
|
|
|
|
2013-2014 Undergraduate Catalog [ARCHIVED CATALOG]
|
COS 451 - Automata, Computability, and Languages Fundamentals of formal languages and the mathematical theory of computation; finitestate automata, nondeterminism, regular expressions, and Kleene’s Theorem; context-free grammars, pushdown automata, the correspondence theorem and the pumping lemma; computability, Turning machines, and the halting problem.
Prerequisites: COS 250.
Course Typically Offered: Spring
Credits: 3
|
|