CS 4410

Automata Theory, Computability, and Formal Languages

Spring, 2000 - T/Th 12:55-2:22

Instructor: Dr. Tom Carter

PSB 287a
667-3175
tom@csustan.edu
http://cogs.csustan.edu/~tom

Texts: The book for the class is:

Introduction to Automata Theory, Languages, and Computation , Hopcroft and Uhlman

General Introduction: The content of this course is the fundamental theoretical background underlying much of Computer Science. You will find that during the course you will need (and develop) a fair degree of `mathematical maturity.' We will be doing proofs, and working in abstract areas on abstract concepts. The course will be challenging, but rewarding . . .

Requirements/Responsibilities: The grades for this course will be based on four components: written homework, participation/discussion, a midterm test, and a final paper/project. Each component will carry approximately the same weight. Plus/minus grading may be used.
The work you do for this course will be your own. You are not to submit other people's work and represent it as your own. However, I do expect and encourage you to work collaboratively with others during the course.