Javascript is currently not supported, or is disabled by this browser. Please enable Javascript for full functionality.

   
    Mar 14, 2025  
2008-2009 Undergraduate Catalog 
    
2008-2009 Undergraduate Catalog [ARCHIVED CATALOG]

Add to Portfolio (opens a new window)

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



Add to Portfolio (opens a new window)