|
|
COURSE SYLLABUS COT 4420: Theory of Computation Prerequisites: MAD 3105 Fall Semester 2009 |
Course
Objective:
The
goal of this course is to provide students with an understanding of basic
concepts in the theory of computation.
Students will learn about a variety of issues in the mathematical
development of computer science theory, particularly finitary representations
for languages and machines, as well as gain a more formal understanding of
algorithms and procedures. At the end
of this course, the student will:
Be able to construct finite state
machines and the equivalent regular expressions.
Be able to prove the equivalence of
languages described by finite state machines, regular grammars and regular
expressions.
Be able to construct pushdown
automata and the equivalent context free grammars.
Be able to prove the equivalence of
languages described by pushdown automata and context free grammars.
Be able to construct Turing
machines.
Be able to understand the Chomsky
Hierarchy.
Be able to have a basic
understanding of the P = NP problem.
Course
Description:
Theory
of automata and formal languages. Finite state automata, Moore and Mealy machines,
regular expressions and languages, deterministic and non-deterministic pushdown
automata, context free languages, context sensitive languages, normal forms,
Turing machines, recursive and recursively enumerable sets, undecidability,
introduction to computability and complexity theory.
Instructor:
Room 263,
Office hours: Tuesday 3 pm – 5 pm
Teaching
Assistant:
Vineet Sahu
Room 20, Love Building
Office hours: Monday 1 pm - 2 pm, Wednesday 11 am – 12 noon
Email: sahu@cs.fsu.edu
Required
Text:
1. [Linz2006] Peter Linz, An Introduction to Formal Languages and Automata, Fourth Edition, Jones and Bartlett, 2006. (required; however previous editions ok also).
Class Schedule:
|
Lectures |
Tuesdays and Thursdays |
11:00 am
– 12:15 pm |
Love 301 |
Lecture
Notes and Information
|
Week # |
Meeting Days |
Reading Assignments &
Information |
Class Notes & Homework
Assignments |
|
1 |
August
25, 2009 August
27, 2009 |
Read
Chapter 1 in text Start reading
Lecture1 Read
Chapter 11.1 in text Finish
reading Lecture1 |
Notes
handed out in class Homework
1: due September 8, 2009 |
|
2 |
September
1, 2009 September
3, 2009 |
Start
reading Lecture2 Continue
reading Lecture2 Hint
for problem 2, Set 1: show that a 1-1 onto map from S -> 2^S does not
exist. |
|
|
3 |
September
8, 2009 September
10, 2009 |
Continue
reading Lecture2 Finish
reading Lecture2 |
|
|
4 |
September
15, 2009 September
17, 2009 |
Start
reading Lecture3 Read
2.1 in text Continue
reading Lecture 3 |
|
|
5 |
September
22, 2009 September
24, 2009 |
Read
3.1, 2.2 – 2.4 in text Read
3.2 – 3.3 in text Finish
reading Lecture 3 |
|
|
6 |
September
29, 2009 October
1, 2009 |
|
|
|
7 |
October
6, 2009 October
8, 2009 |
Midterm 1 Read Lecture4 Read Chapter 4 in text. |
|
|
8 |
October
13, 2009 October
15, 2009 |
Start
reading Lecture5. Read Chapter 5 in
text. Read
Lecture5 pages 70-78. |
Homework
4: due October 20, 2009 (no late homework accepted, will go over the homework
on October 20 in class) |
|
9 |
October
20, 2009 October
22, 2009 |
Review
of Homework 4 Read
Lecture5 pages 79-93. Start
reading Chapter 6 in text |
|
|
10 |
October
27, 2009 October
29, 2009 |
Read
Chapter 6.1 Review
Lecture5 notes Read
Chapter 6.2 |
|
|
11 |
November
3, 2009 November
5, 2009 |
Start
reading Lecture6, pages 94-97 Read
Chapter 7.1 Finish
reading Lecture6, Start
reading Lecture7 Read
Chapters 7.2 – 7.4 |
Homework
6: due November 12, 2009 |
|
12 |
November
10, 2009 November
12, 2009 |
Read Lecture7, pages 105-108 Read Chapter 8.1, Chapter 6.3 Read Lecture7, pages 109-113 Read Chapter 8.2 |
|
|
13 |
November
17, 2009 November
19, 2009 |
Midterm 2 Start
reading Chapter 9 |
|
|
14 |
November
24, 2009 November
26, 2009 |
Finish
Chapter 9, Read Lecture8 Read
Chapter 10, Review 11.1, 11.4 Thanksgiving
Day Holiday. No Classes |
|
|
15 |
December
1, 2009 December
3, 2009 |
Read Chapter 12.1, 14.3, and 14.4 Test and Homework Reviews Review for the Final.
Review Homework 7. |
|
|
Exam
Week |
December
9, 2009 |
FINAL EXAM, 12:30 pm – 2:30
pm Room
301, J. J. Love Building |
|
|
|
|
Grading:
1. There will be two midterm tests (25% each) and a final (25%).
2. There will be about 7 problem sets during the semester (25% total). It is very important to complete all problem sets. You may talk to me, the teaching assistant, or other students to help you get started on a problem, but you must do the problems by yourself.
3. The first midterm is tentatively scheduled October 16, 2009. The second midterm is tentatively scheduled November 17, 2009. The final will be during finals week on December 9,2009. Tests may include material covered in earlier tests.
COURSE POLICIES:
ACADEMIC
HONOR POLICY:
The Florida State University Academic Honor Policy outlines the University’s
expectations for the integrity of students’ academic work, the procedures for
resolving alleged violations of those expectations, and the rights and
responsibilities of students and faculty members throughout the process.
Students are responsible for reading the Academic Honor Policy and for living
up to their pledge to “. . . be honest and truthful and . . . [to] strive for
personal and institutional integrity at Florida State University.”
(Florida State University Academic Honor Policy, found at http://dof.fsu.edu/honorpolicy.htm.)
AMERICANS
WITH DISABILITIES ACT:
Students with disabilities needing academic accommodation should:
(1) register with and provide documentation to the Student Disability Resource
Center; and
(2) bring a letter to the instructor indicating the need for accommodation and
what type. This should be done during the first week of class.
This syllabus and other class materials are
available in alternative format upon request.
For more information about services
available to FSU students with disabilities, contact the:
Student Disability Resource Center
874 Traditions Way
108 Student Services Building
Florida State University
Tallahassee, FL 32306-4167
(850) 644-9566 (voice)
(850) 644-8504 (TDD)
sdrc@admin.fsu.edu
http://www.disabilitycenter.fsu.edu/
ATTENDANCE POLICY:
Excused
absences include documented illness, deaths in the family and other documented
crises, call to active military duty or jury duty, religious holy days, and
official University activities. These absences will be accommodated in a way
that does not arbitrarily penalize students who have a valid excuse.
Consideration will also be given to students whose dependent children
experience serious illness.
SYLLABUS CHANGE POLICY:
Except
for changes that substantially affect implementation of the evaluation (grading)
statement, this syllabus is a guide for the course and is subject to change
with advance notice.