|
Jan 28, 2025
|
|
|
|
COS 451 - Automata, Computability, and Languages Fundamentals of formal languages and the mathematical theory of computation; finite-state automata, nondeterminism, regular expressions, and Kleene’s Theorem; context-free grammars, pushdown automata, the correspondence theorem and the pumping lemma; computability, Turing machines, and the halting problem.
Prerequisites: COS 301
Course Typically Offered: Spring
Credits: 3
Add to Portfolio (opens a new window)
|
|