2018-2019 Catalog 
    
    Mar 21, 2023  
2018-2019 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 either MATH 3130 or CS 2300; College of Engineering students only. Meets with CS 5700.



Add to Portfolio (opens a new window)