Mar 28, 2024  
2014-2015 Graduate Catalog 
    
2014-2015 Graduate 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 & Notes
COS 250.

Credits: 3