CSCI 510 - Automata and Formal Language Theory

Description
Advanced treatment of formal languages and automata; finite state machines; stack machines and Turing Machines; the Chomsky hierarchy; regular, context free, context sensitive languages, recursively enumerable languages.
Credits
4
Recent Professors
Open Seat Checker
Schedule Planner
Recent Semesters
Fall 2019, Fall 2018, Fall 2017
Offered
MTuWF
Avg. Class Size
30
Avg. Sections
1