AUTOMATA and FORMAL LANGUAGES
COT5310 01 || COT5310 02
TERM: Fall 2000
CLASS MEETING TIMES:
Section 01 T R 02:00-03:15 pm 120 BEL
Section 02 T R 08:00-09:15 am 005 STB
INSTRUCTOR: Hilbert Levitz
|
GRADER: Jin Shang
|
PREREQUISITE: COT 4420. This will be strictly enforced.
TEXT: Computability, Complexity, and Languages: Fundamentals
of Theoretical Computer Science, by Davis, Sigal, & Weyuker, 2-nd Edition,
Academic Press 1994
CS DEPARTMENT COMPUTING SYSTEMS: Students in the course are required
to have an account on CS department computing systems. You can register
for an account at the CS Department Udgergraduate Computer Lanboratory
in 006 Love Building. There is an automated registration procedure for
obtaining an account and instructions are posted on the wall of the lab.
On CS systems your e-mail address will be the same as your login name.
This is the address which will be used in communicating with you about
matters pertaining to the course and other CS department business. If you
read your mail on a different system, you should set mail forwarding from
CS systems to that system.
OBJECTIVES: To attain a sufficiently advanced level in
theoretical computer science that the literature of treatises and
research papers becomes acessible.
EXAMS: There will be two mid-terms of one hour and a final of
two hours.
Exam Dates: 1-st Midterm
Thursday October 5
2-nd Midterm Thursday November
16
Final
Section 01 Tuesday December 12, 05:30-07:30
pm
Section 02 Tuesday December 12, 10:00-12:00
am
GRADING:
First Midterm
30%
Second Midterm 30%
Final
30%
Graded Excercises 10%
-------
100%
EXERCISE TURN IN.. In general, excercises do NOT need to be turned in except when explicity announced to the contrary. Excercises which are assigned for turn-in will not be accepted late. Period!
TOPICS
Chapter 1 Preliminaries Sections 1-7
Chapter 2 Programs and Computable Functions
Sections 1-3
Chapter 3 Primitive Recursive Functions Sections
1-8
Chapter 4 A Universal Program Sections 1-8
Chapter 9 Grammars and Automata Sections 1-7
Chapter 10 Context-Free Languages Sections 1-5, 7-9
Chapter 11 Context-Sensitive Languages Sections 1-3
If time permits, we shall discuss Sections 1-3 of Chapter 15 on Polynomial
Time Complexity