Course Schedule - Spring Semester 2009

     

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

AUTOMATA/FORMAL LAN/COMPUTABLE

Long Title: AUTOMATA, FORMAL LANGUAGES, AND COMPUTABILITY
Department: Computer Science
Instructor: Nakhleh, Luay
Meeting: 2:30PM - 3:50PM TR (5-JAN-2009 - 17-APR-2009) 
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: 19
Enrollment data as of: 31-OCT-2024 6:18PM
 
Additional Fees: None
 
Final Exam: Final Exam Unknown
 
Description: Finite automata, regular expressions, regular languages, pushdown automata, context-free languages, Turing machines, recursive languages, computability, and solvability. Recommended Prerequisites: COMP 314 and COMP 280.