Mar 28, 2024  
2019-2020 Undergraduate Bulletin 
    
2019-2020 Undergraduate Bulletin [ARCHIVED]

Add to Favorites (opens a new window)

MSCS-271 Formal Languages and Finite Automata


(3 cr.)
Repeatable for Credit: No
Topics on the foundation of the theory of computation, including languages, grammars, regular expressions, finite state machines, Turing machines.
Prerequisites: Take CS 145  and take either MATH 180  or MATH 270  



Add to Favorites (opens a new window)