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.
Prerequisites: Computer Science 111 and Mathematics 108 or 219.
If Wabash feels like a fit, we would love to talk to you. Call 1-800-345-5385 or email firstname.lastname@example.org