COT 6315 -- Formal Languages and Computation Theory
Last Edited: Wed Nov 2 17:21:43 2005 by jnw (Joseph N. Wilson) on shine.cise.ufl.edu
Syllabus
- Semester Credit Hours:
- 3
- Number of Lecture Hours:
- 41 (50 minute) lectures
- Class Meeting Time
-
- Instructor
- Joseph N. Wilson
(jnw@cise.ufl.edu)
Room E358 CSE Bldg.
Phone: (352) 392-1360
Office Hours: TBA
- Prerequisites:
- COP 3530 (Data Structures) and familiarity with
discrete mathematics and data structures
- Textbook
-
Michael Sipser,
Introduction to the Theory of
Computation, PWS Publishing Company, 1997, ISBN
0-534-94728-X.
- Course Objectives
- To become familiar with the fundamentals of automata theory,
formal languages, Turing machines and computability.
- Course Description
- Introduction to theoretical computer science including formal
languages, automata theory, Turing machines, and computability.
- Course Requirements:
-
- Homework (30%)
- One assignment per class (after the first class)
- Three Midterm Examinations (15% Each)
-
- Final Examination (25%)
-
- Extra credit project (full credit on this provides 5% extra)
- Write a 1,000 word book review on any book of your choosing.
The review must be scholarly and intelligent. It must be
both gramatically and stylistically correct. A draft will
must be turned in by 22 March.
- Course Outline by Topical Areas:
- The course is divided into four major sections dealing with
- Introductory Mathematical Foundations, Regular Languages
and Finite State Machines
- Context-Free Languages and Pushdown Automata
- Turing Machines, Unrestricted Languages, and
Decidability
- Reducability, and Computability Theory
Detailed Outline:
- Mathematical Notation and Foundations
- Constructing Proofs
- Finite Automata
- Nondeterministic and Deterministic Finite Automata
- Regular Expressions
- Proving a Language to be Nonregular
- Context-free Grammars
- Pushdown Automata
- Proving a Language to be Non-context-free
- Turing Machines
- Variants of Turing Machines
- Relation Between Algorithms and Turing Machines
- Decidability
- The Halting Problem
- Undecidable Language Problems
- Post's Correspondence Problem
- Mapping Reducibility
- The recursion Theorem
- Decidability of Logical Theories
- Turing Reducibility
- Decidability of Logical Theories
- Information Representation
- Measuring Complexity
- The Class P
- The Class NP
- NP-Completeness
- NP-Complete Problems
- Savitch's Theorem
- The class PSPACE
- PSPACE-Completeness