[syllabus] | [lecture notes] | [HW1-6,Q1] | [HW7-10,Q2,F] | [project]

[simulators/parsers] | [language definitions] | [automata definitions] | [computable definitions]

CMSC 451 Automata Theory and Formal Languages

TuTh 7:00-8:15pm FA 018

WWW access http://www.csee.umbc.edu/~squire then cs451

Textbook: Introduction to Automata Theory, Languages, and Computation

by Hopcroft and Ullman ISBN 0-201-02988-X Copyright 1979 by Addison-Wesley, or ISBN 0-201-44124-1 Copyright 2001 by Addison-Wesley Second Edition. Reading and homework assignments are from these books, Second Edition page updates coming as course proceeds.

Grading Policy

 Distribution                       Course grade

 Final Exam    20%                  A 90% - 100%
 Quiz 1        15%                  B 80% - 89.9%
 Quiz 2        15%                  C 70% - 79.9%
 Project       10%                  D 60% - 69.9%
 Homework      40%
                            
 Partial credit is given on homework and project.
 No partial credit on multiple choice, true-false, single answer exam questions.

Spring 2001 grades HERE, check for typo's

UMBC rules apply to cheating. You may work together and discuss homework and the project. You must do your own work and not copy from anyone else! Copying/cheating will result in a minimum punishment of a zero on that assignment for all parties involved.

Computer usage

 All students must have an account on the UMBC gl machines.
 The project and some homework will use the "submit" mechanism.
 All students must be able to access the WWW to get assignments.
 Modem and telnet connections are available for remote use.

Jon Squire, Lecturer, office hours:

  MW 3:00-5:00,  ECS 219.

Umang Choudhary, TA, office hours:

  Tuesday 5:00-6:00 , homework questions and grading
  EMail: umang@csee.umbc.edu

Course Links

Last updated 25 Nov 2003