CS 3110 - Formal Languages and Automata (3)

Finite automata. Non-determinism. Regular expressions and languages. Context-free grammars and push down automata. Ambiguity. Closure properties. Normal forms. Context-free and non-context-free languages.

Prerequisite(s): CS major and C or better in CS 2400; or consent of instructor.
Grading Basis: Graded Only
Repeat for Credit: May be taken only once
When Offered: Fall, Spring, Summer, Winter
Course Category: Major Required Course