CS345 01: Automata

Syllabus  

My Notes   My Account   Logout
Home
Instructor
Syllabus
Course Content
Discussion Area
GradeBook
Web Links
Student Registration
Courses
Go To Sessions

Course Materials
Introduction to the Theory of Computation
by Michael Sipser
PWS Publishing Company
ISBN 0-534-94728-X

Course Goals
Students will gain an understanding of several fundamental models of computation, i.e., automata. They will learn about the capabilities and limitations of these automata, and the implications for computer science. Each of these types of automata corresponds to a class of formal languages, and students will study the structure of these languages. The course also teaches students basic concepts that are needed in more advanced computer science courses.

Course Policies

Grading

Grading will be based on quizzes, three exams and a final. Quizzes will be given at the end of each Friday class, and will be similar to exercises that will be posted as homework. Absence from a quiz or exam must be approved beforehand, or in case of unexpected absences, by the Dean of Student Life. No A or B exemptions from the final will be given.

The grade will be determined as follows:

Homework, worth 10% of the total grade

Three Exams, each worth 22% of the total grade


Exam dates:
Wednesday, September 17
Wednesday, October 15
Wednesday, November 12

Final Exam, worth 24% of the total grade

Course Term
From August 25, 2003 To December 5, 2003

Sessions:

August, 2003
S M T W TH F S
          1 2
3 4 5 6 7 8 9
10 11 12 13 14 15 16
17 18 19 20 21 22 23
24 25 26 27 28 29 30
31            
September, 2003
S M T W TH F S
  1 2 3 4 5 6
7 8 9 10 11 12 13
14 15 16 17 18 19 20
21 22 23 24 25 26 27
28 29 30        
October, 2003
S M T W TH F S
      1 2 3 4
5 6 7 8 9 10 11
12 13 14 15 16 17 18
19 20 21 22 23 24 25
26 27 28 29 30 31  
November, 2003
S M T W TH F S
            1
2 3 4 5 6 7 8
9 10 11 12 13 14 15
16 17 18 19 20 21 22
23 24 25 26 27 28 29
30            
December, 2003
S M T W TH F S
  1 2 3 4 5 6
7 8 9 10 11 12 13
14 15 16 17 18 19 20
21 22 23 24 25 26 27
28 29 30 31      

Basics: Mathematical Notions and Methods of Proof (Chapter 0)
From August 25, 2003 To August 27, 2003

Regular Languages and Finite Automata (Chapter 1)
From August 29, 2003 To September 15, 2003

Context-Free Languages and Pushdown Automata (Chapter 2)
From September 19, 2003 To October 13, 2003

Turing Machines and the Notion of Algorithm (Chapter 3)
From October 17, 2003 To October 20, 2003

Decidability (Chapter 4)
From October 22, 2003 To October 31, 2003

Reducibility (Chapter 5)
From November 03, 2003 To November 10, 2003

Time Complexity (Chapter 7)
From November 14, 2003 To December 05, 2003

This page has been viewed 590 times since August 6, 2002.

Home    Instructor    Syllabus    Course Content    Discussion Area    GradeBook    Web Links    Student Registration    Courses
Please choose a section.

Portions copyright ©2002 The McGraw-Hill Companies.
Any use is subject to the Terms of Use and Privacy Policy.
McGraw-Hill Higher Education is one of the many fine businesses of The McGraw-Hill Companies.