2010-2011 Catalog 
    
    Apr 19, 2024  
2010-2011 Catalog [ARCHIVED CATALOG]

Add to Portfolio (opens a new window)

CS 4700 - Computability, Automata and Formal Languages

3 Credits (Minimum) 3 Credits (Maximum)

Finite automata and regular expressions, context-free grammars, context-free languages, and pushdown automata, Turning machines, undecidability, the Chomsky hierarchy of formal languages, computational complexity and intractable problems. Prer., MATH 2150 and MATH 3130. Meets with CS 5700.



Add to Portfolio (opens a new window)