CSCE 935 Spring 2001

Mathematical Theory of Finite Automata

Lecture: MWF 2:30-3:30 pm, FERG 113

Instructor: Dr. Iyad Abu-Jeib

Office: 213E Ferguson Hall

Homepage: http://www.math.unl.edu/~ijieb/

E-mail: abu-jeib@cse.unl.edu

Office Phone: 472-5004

Office Hours: MWF 1:00-2:00, or by an appointment.

Textbook: Computational Complexity, by Christos H. Papadimitriou,

Addison-Wesley 199

Note: the textbook is optional (not required).

Prerequisite: CSCE 428/828 or permission.

Material: We will cover some material from the text and some material from other

sources.

Grading:

Two Exams: 40% (20% each)

Homework: 40%

Project / Presentation: 20%

Question: Do you prefer a different distribution? There is room for flexibility!

Scale:

A+ ( 95 – 100 % ). A ( 90 – 94 % ). B+ ( 85 – 89 %). B ( 80 – 84 %).

C+ ( 75 – 79 % ). C ( 70 – 74 % ). D+( 65 – 69 % ). D (60 – 64 %). F (< 60 % ).

Remarks:

1. Attendance is required.
2. The syllabus is subject to change.
3. I’ll go slowly over the material.