MyBash | Mobile | Offices |
Directories

CSC 341 Introduction to Automata, Computabiligy, and Formal Languages

An introduction to theoretical computer science. Finite state machines and regular expressions. Context—free languages and push-down automata. Turing machines, effective computability, and the Halting Problem. Offered irregularly.


Prerequisites: CSC 111 and MAT 108 or 219.


Credits: 1