UMBC CMSC651, Automata Theory & Formal Languages, Spring 1999

Course Description

Time & Place

Tuesday & Thursday, 4:00pm - 5:15pm, SS208.

Textbook

Required: Introduction to the Theory of Computation, M. Sipser, PWS Publishing, 1997.
Optional: Introduction to Automata Theory, Languages, and Computation, J. Hopcroft and D. Ullman, Addison-Wesley, 1979

Prerequisites

The undergraduate automata theory course (CMSC 451) is formally a prerequisite for this class. Where possible, this class will be self contained --- i.e., students are not required to know many theorems that are not covered in class. However, it is important for the students in this class to be prepared to read and write mathematical proofs at a level that is consistent with having taken CMSC 451 or an equivalent course.

Objectives

To understand some fundamental theorems in theoretical computer science.
To develop the ability to write clear and convincing proofs.
To build the background necessary for further studies in theoretical computer science.

Assignments and Grading

Your grade in this course will be based on 9 regular homework assignments and 3 review assignments. Each regular assignment is worth 7 points and each review assignment is worth 12 points. There are no in-class exams.

The difference between a regular assignment and a review assignment is as follows. You are allowed to consult your classmates and others for the regular assignments (but you must write up the assignment yourself). In contrast, you must work on the review assignments on your own using only your textbook and your notes. In general, regular assignments should be submitted when they are due, but reasonable allowances will be made for turning in regular assignments late. However, the due dates for the review assignments will be firm.

Last Modified: 22 Jul 2024 11:29:48 EDT by Richard Chang, chang@umbc.edu