Term: F
Catalogue Number 879001
| Day | Time | Location
CCB 121 ------------------------ Except for Correspondence and Internet courses, some final examinations could take place in a different room and on a different day from the regularly scheduled class. Check the published Examination Schedule for a complete list of days and times. |
|||
| Tuesday and Thursday | 2:30-4:00 pm
[See also Lecture Schedule] |
||||
| Instructor: | Professor G.
Tourlakis,
Office: 354 Chemistry & Computer Science Building, Telephone: 736-2100-66674, e-mail: gt@cs.yorku.ca |
|
| Start date: | Sept. 12, 2000 | |
It is the responsibility of students to check the course web page weekly for course related information.
COURSE DESCRIPTION
This course covers fundamental theoretical computer science topics that find application in a wide variety of areas in the field (e.g., the design and analysis of computer algorithms, program semantics and correctness, programming language specification and translation).
Topics will include:
Formal Languages and their acceptors,
specifically, the following themes: Regular and Context free
languages and finite and pushdown automata; Introduction
to
"type-0" languages, Turing Machines and Computability.
Unsolvability,
elementary reducibility examples.
PREREQUISITES:
Department of Computer Science General
Prerequisites.
This course will call decisively
on your mathematical background.
REQUIRED TEXT/S
Introduction to the
Theory of Computation, by Michael Sipser, PWS Publishing Company. ISBN
0-534-94728-X
SUGGESTED TEXT
J. E. Hopcroft and J. D. Ullman, Introduction to Automata Theory,
Languages and Computation, Addison-Wesley. ISBN 0201 029 88-X
H. R. Lewis and C. H. Papadimitriou, Elements of the Theory of Computation,
Prentice Hall (latest edition). ISBN 013 2734176
WEIGHTING OF COURSE
| Term work (Assignments 30% and Test (in-class) 30%) | 60% | |
| Final Exam (Time/place TBA: Sometime between Dec. 6-21 (incl.)) | 40% |
Term Test Date/Time: October 24, 2000 (in class).
Last revised:Fri Sep 1 13:47:53 2000