Course Schedule and Catalog

Long Title: AUTOMATA, FORMAL LANGUAGES, AND COMPUTABILITY

Department: Computer Science

Grade Mode: Standard Letter

Course Type: Lecture

Credit Hours: 3

Description: Finite automata, regular expressions, regular languages, pushdown automata, context-free languages, Turing machines, recursive languages, computability, and solvability. It is strongly recommended that students complete three semesters of Mathematics before enrolling in this course.