Office hours
MW 13:00 - 14:00 or by appointment
Texts
Recommended:
Introduction to Automata Theory, Languages and Computation, John E. Hopcroft,
Rajeev Motwani and Jeffrey D. Ullman, 2nd edition, Addison Wesley 2001
(ISBN: 0-201-44124-1).
Required:
Languages and Machines, An Introduction to the Theory of Computer Science.,
Thomas A. Sudkamp, 3rd edition, Addison Wesley 2004.
Prerequisites
MATH 1450; CS 3310; CS 4800
Course Objectives
1. An understanding of concepts of (un)decidability, including Turing
machines and the Church-Turing thesis.
2. An understanding of recursive and partial recursive functions.
3. An understanding of recursive sets and recursively enumerable sets.
4. An understanding of the Chomsky hierarchy of languages, with their
grammars and automata.
5. The topics introduced in CS 4800 will be treated more rigorously in CS 5800.
Computer Usage
High-level languages will be used to implement the programming requirements
of assignments and projects.
Learning outcomes
-
Students will demonstrate basic knowledge of definitions and theorems
relating to computability.
-
The students will demonstrate intermediate-level knowledge of definitions
and theorems relating to automata, grammars, and formal languages.
-
Students will demonstrate the ability to apply proof techniques and algorithms
to questions associated with automata, grammars, and languages.
-
Students will demonstrate the ability to synthesize knowledge of automata and grammars
to solve problems relating to language specification and machine computation.
Evaluation
There will be 3 tests (tentatively on: 9/28, 10/28, 11/23)
and a final examination. Of the homework assignments,
several are not to be turned in. It will be clearly stated which
homework/projects
need to be turned in. The tests carry 55% of the grade, assignments
and miscellaneous 45%. Problems with class attendance may lead to a failing grade.
Grading
The following scale will be used to determine your final grade on the
basis of your final average:
A: 92.0 - 100.0,
BA: 88.0 - 91.9,
B: 82.0 - 87.9,
CB: 78.0 - 81.9,
C: 72.0 - 77.9,
DC: 68.0 - 71.9,
D: 60.0 - 67.9,
E: below 60.0.
Academic Integrity Policies
You are responsible for making yourself aware of and understanding the
policies and procedures in the Undergraduate Catalog (pp. 271-272) that
pertain to Academic Integrity. These policies include cheating, fabrication,
falsification and forgery, multiple submission, plagiarism, complicity
and computer misuse. If there is reason to believe you have been involved
in academic dishonesty, you will be referred to the Office of Student
Judicial Affairs. You will be given the opportunity to review the charge(s).
If you believe you are not responsible, you will have the opportunity
for a hearing. You should consult with me if you are uncertain about an
issue of academic honesty prior to the submission of an assignment or
test.
Link to CS 6800 page