Course Schedule - Spring Semester 2004

     

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: 20162)

AUTOMATA, FORMAL LAN&COMPUTABL

Long Title:
Department: Computer Science
Instructor: Greiner, John
Meeting: 1:00PM - 1:50PM MWF (12-JAN-2004 - 8-MAY-2004) 
Part of Term: Full Term
Grade Mode: Standard Letter
Course Type: Lecture
Method of Instruction: Face to Face
Credit Hours: 3
Course Syllabus:
 
Prerequisites: COMP 314
Section Max Enrollment: 500
Section Enrolled: 21
Enrollment data as of: 1-JUN-2024 11:39PM
 
Additional Fees: None
 
Final Exam: Final Exam Unknown
 
Description: AUTOMATA, FORMAL LANGUAGES, AND COMPUTABILITY ***** Finite automata, regular expressions, regular languages, pushdown automata, context-free languages, Turing machines, recursive languages, computability, and solvability. Prerequisite(s): COMP 314