CS 4100 - Formal Language Theory

Credits: 3

Description: Various types of languages (context-sensitive, context-free, regular). Discussion of recognition devices such as pushdown automata, linear bounded automata and Turing Machines. Some topics of current interest.

Prerequisite(s): MATH 2220 or MATH 3220.
When Offered: Fall (odd years.)