Class:                     COT5310                Theory of Programming Languages and Automata

 

Meetings:              T R  5:00 - 6:15     

 

Text:                       Introduction to the Theory of Computation, Michael Sipser,      hardback only acceptable!

 

Instructor: Dr. Riggs,  850-412-7351,  213 BBTA,           T,W,R  12:30-3, mailto:drriggs@comcast.net, www.cis.famu.edu/~riggs

 

COT5310 Theory of Programming Languages and Automata Prereq: COT3101, COT4210( or equivalent)
Gives a formal background in computing theory and programming languages including the basis of machines and programming. Logical network and switching theory sequential theory and automata, and Turing machines and computability. Foundations of automata, formal languages of recursion theory

 

Approach: Problems. Problems, problems! Although I try hard to motivate the material (as does Sipser) you must be able to do problems! You will have to perform in class on occaision.

 

Approximate Calendar by Text Chapters (italics indicate chapters perhaps NOT read):

Introduction & Review

0.        Introduction

Automata and Languages

1.        Regular Languages

2.        Context-Free Languages

Computability Theory

3.        The Church-Turing Thesis

4.        Decidability

5.        Reducibility

Complexity Theory

7.        Time Complexity

8.       Space Complexity

9.        Intractability

10.    Advanced topics in Complexity Theory

 

Actual rate/depth will depend on the class, but all (non-italic) will be covered!

 

 

Grading:

                Item                                 Apprx #    % of final grade                         (all individual items graded 0…100%)

1. Homework                             8-10         30%                                                       
2. Exams                                     3              60%
3. Participation                          n/a          10%                                        Includes in class demonstrations

 

Final_grade = .3*Hmwrk% + .6*Exam% +.1*Part%                                then >=90àA, >=80àB, etc

 

Rules:

1. Attendance is required. All absences will count against the participation score.
2. Work missed due to absence will be accepted only when an excuse from the dean is presented and it shows an unforeseeable situation. All other work must be handed in (at least by e-mail) on time.
3. No work will be accepted later than the deadline announced in class or on the material.
4. All work is individual unless clearly stated otherwise.
5. Cheating, of any kind or degree, is cause for dismissal from the class with a grade of F.
6. Proper deportment, e.g. no cell phones, no bathroom breaks, etc. is part of the participation grade. (If you must leave early, or are ill, inform me in advance.)