Sep 24, 2018  
2017-2018 Catalog 
    
2017-2018 Catalog [ARCHIVED CATALOG]

[Add to Portfolio]

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 either MATH 3130 or CS 1300; College of Engineering students only. Meets with CS 5700.



[Add to Portfolio]