Formal Languages & Machines
University of Alabama
CourseCS 475
Regular expressions and finite automata. Context free grammars and pushdown automata. Recursively enumerable languages and the Turing machine. The Chomsky hierarchy.
- Credits
3 credits
- Course Code
CS 475
Related Courses
Prerequisites, corequisites, and courses that build on this one
Prerequisites
Complete these courses before enrolling