UMBC CMSC 651, Automata Theory & Formal Languages, Spring 2003, Section 0101

Course Description

Time & Place

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

Textbook

Introduction to the Theory of Computation, M. Sipser, PWS Publishing, 1997.

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 ten regular homework assignments, three tests and a final exam. Each homework assignment is worth 3 points, each test 16 points and the final exam 22 points.

Revised grade distribution: Due to the blizzard 1 test has been eliminated and the grading has been revised as follows. Each of the two remaining tests is worth 20 points and the final exam is worth 30 points.

You are allowed to consult your classmates and others for the homework assignments (but you must write up the assignment yourself). The difference between assignments that have been copied and assignments that have been written up independently after the sharing of ideas is very obvious --- especially in a small class. You are allowed to share ideas, but you are not allowed to copy.

In general, homework assignments should be submitted when they are due, but reasonable allowances will be made for turning in regular assignments late.

Last modified: 25 Feb 2003 11:20:45 EST by Richard Chang, chang@umbc.edu

to Spring 2003 CMSC 651 Homepage