CS 4410 - Automata, Computability, and Formal Languages3 unit(s) Finite state concepts; sequential machines and state minimization; Chomsky grammar; algorithms on grammars; computability and Turing machines; non-computable functions.
Prerequisites: CS 3100 and MATH 2300
Schedule of Classes | University Bookstore
Add to Favorites (opens a new window)
|