CSCI 510 - Automata and Formal Language Theory

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.

Prerequisites & Notes:
CSCI 211 or equivalent.

Credits: 4
Grade Mode: L

Sciences and Technology
Computer Science