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

COURSE NOTES:

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

Course Schedules

Choose a link below to view the course schedule for the current and previous academic term(s).

ALL STUDENTS (Except Pharmacy)

Previous Terms