University of Alabama
Regular expressions and finite automata. Context free grammars and pushdown automata. Recursively enumerable languages and the Turing machine. The Chomsky hierarchy.
3 credits
CS 475
Prerequisites, corequisites, and courses that build on this one
Complete these courses before enrolling
