Dec 08, 2025  
2025-2026 Catalog 
    
2025-2026 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., CS 2150 or MATH 2150 with a grade of “C” or better. College of Engineering students only. Meets with CS 5700. Course typically offered: Fall, Spring



Add to Portfolio (opens a new window)