[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 4:00-5:15pm ITE 229

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

Textbook: Introduction to Automata Theory, Languages, and Computation

by Hopcroft, Motwani and Ullman ISBN 0-201-44124-1 Copyright 2001 by Addison-Wesley Second Edition. Reading and homework assignments are from these books,

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.

 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:

  W    3:30-5:00,  ITE 226
  TuTh 2:00-3:30,  ITE 226
  Email: squire@umbc.edu

Wiboonsak Watthayu, Grader

  EMail: wwatth1@cs.umbc.edu

Course Links

Last updated 21 May 2004