CS 3613
Theoretical
Foundations of Computing
Instructor:
Debao
Chen
Office:
North Hall 324
Office Hours: M WR 3:00 pm – 4:30 pm, or
by appointment
Phone: (918) 594-8554
Email: cdebao@okstate.edu cdebao@osu-tulsa.okstate.edu
Web: http://www.cs.okstate.edu/~cdebao
Teaching
Assistant:
Mr. Qiurui Zhu
Email: qiurui@cs.okstate.edu
Required Text:
Michael Sipser, Introduction to the Theory of
Computation, Second edition
Reference books:
1. John C. Martin, Introduction
to Languages and the Theory of Computation
2. Eitan Gurari, An
Introduction to the Theory of Computation
3. Harry R. Lewis and Christos
H. Papadimitriou, Elements of the Theory of Computation
4. Raymond Greenlaw and H.
James Hoover, Fundamentals of the Theory of Computation: Principles and
Practice
Course description:
Introduction to the classical theory of computer
science. Sequential machines and their
applications to devices, processes, and
programming. Models of computation: finite
state automata, push-down automata, Turing
machines. The role of non-determinism.
Material to be covered:
1. Chapter 0, Introduction
2. Chapter 1, Regular Languages
3. Chapter 2, Context-Free Languages
4, Chapter 3, The Church-Turing Thesis
5, Chapter 4, Decidability
6, if time permits, we will cover more material on
the complexity theory and NP-
Completeness
Attendance policy:
Attendance is usually has a high correlation with
how well you perform in a course.
Students
should talk with the instructor about any absences. Attendance is not required,
but is
strongly encouraged. Students are responsible for
any
material covered in class, including material that does not appear in the text.
If
students
miss the class too many times, at the instructor’s judgement, the instructor
may give
them an oral examination to evaluate their understanding of the missing
classes.
Homework:
1. Homework will be assigned on
every class day, with possible a few exceptions.
2. Homework will be collected
on every Thursday class time, unless the instructor notifies otherwise.
3. If for whatever reason, you
cannot attend a Thursday class, with my permission, you may email your homework
to the TA.
4. Homework assignments will be
posted on the web after each class.
5. Late homework will not be
accepted.
Grading:
Homework: 30%
Mid-term: 30%
Final:
40%
Grade scale:
90 – 100% A
80 –
89% B
70 –
79% C
60 –
69% D
Below
60% F
Collaboration policy:
1. Homework: Discussion of concepts, ideas, and techniques
is allowed and
is encouraged. After
discussion, each student must write up his/her own solution.
Copying
another person's work is not allowed. Giving your work to another student
is
considered cheating as well.
2. Examinations: Any kind of communication among students is not
allowed.
3. Any case of academic
dishonesty would result in a reduction of one letter grade.
All cases of academic
dishonesty would be reported to the university administration.
If any student feels that
he/she has a disability and needs special accommodation of any nature whatsoever,
the instructor will work with you and the University Services to provide
reasonable accommodation to ensure that all students have a fair opportunity to
perform in this class. Please advise the instructor of any such disability and
the desired accommodations as soon as possible.
Syllabus attachment
Syllabus attachment of OSU can be
viewed on http://osu.okstate.edu/acadaffr/aa/syllabusattachment-Spr.htm.
Syllabus
attachment of OSU-Tulsa is attached.
01/09/2008