CSCE 4115 - Formal Languages, Automata and Computability

3 hours

Introduces students to the formal language theory that underlies modern computer science. Topics include different representational forms for regular languages, context-free grammars, pushdown automata, pumping lemmas for regular and context-free languages, and Chomsky’s hierarchy.

Prerequisite(s): CSCE 2100 and CSCE 2110, each with a grade of C or better.

Course specific fees (in addition to tuition and mandatory):
Academic (AF) per hour: $52.70