CPS 4501

FORMAL LANGUAGES AND AUTOMATA THEORY

Kean University · UGRD · Fall 2026

1 section

Catalog description

Formal definitions of automata, including the finite automaton, the pushdown automaton, and the Turing Machine. Different types of formal languages and their relationships to automata. The Church-Turing Thesis and the notion of algorithm. Decidability and Solvability.

Sections

Current meeting, instructor, credit, and enrollment details

Updated 6 hours ago

001

Availability not recently verified

Class #kean-CPS4501Fall 2026UGRD3 credits

Days & times: No scheduled meeting time
Meeting dates: —
Location: —
Instructor: Staff

Class numbers and section codes come from the registrar.

Spot missing or incorrect course data?