Roosevelt University in Chicago, Schaumburg and Online - Logo

Course Details


CST 410 - FORMAL LANGUAGES AND AUTOMATA

Finite automata and regular languages. Push-down automata and context-free languages. Turing machines and models of computations . See also Math 410.

Credits: 3

Prerequisites:

There are no prerequisites listed for this course.

Course Notes:

Cst 280 and Math 245 both with a min grade C- required.