Course Schedule and Catalog
Course Schedule - Fall Semester 2013
Meeting location information can now be found on student schedules in ESTHER (for students) or on the Course Roster in ESTHER (for faculty and instructors).Additional information available here.
Meeting location information can now be found on student schedules in ESTHER (for students) or on the Course Roster in ESTHER (for faculty and instructors).Additional information available here.
COMP 481 001 (CRN: 17763)
AUTOMATA/FORMAL LAN/COMPUTABLE
Long Title: AUTOMATA, FORMAL LANGUAGES, AND COMPUTABILITY
Department: Computer Science
Instructor: Goldman, Ron
Meeting: 2:30PM - 3:45PM TR (26-AUG-2013 - 6-DEC-2013)
Part of Term: Full Term
Grade Mode: Standard Letter
Course Type: Lecture
Method of Instruction: Face to Face
Credit Hours: 3
Course Syllabus:
Section Max Enrollment: 50
Section Enrolled: 28
Enrollment data as of: 11-MAY-2024 8:41PM
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.