CS 5723 - Automata Theory

Sem. Hrs: 3

Study formal languages and equivalent models of computation. Finite state automata and regular expressions. Push-down automata and context free grammars. Pumping lemmas and closure properties. Turing Machines.

Prerequisites: CS 3113 or “B” or better in CS 5032.
Dual Listed/Cross Listed: Dual listed as CS 4723.