[ Wesleyan Home Page ] [ WesMaps Home Page ] [ WesMaps Archive ] [ Course Search ] [ Course Search by CID ]
Academic Year 2000/2001


Automata Theory and Formal Languages
COMP 301 FA

This course is an introduction to formalisms studied in computer science and mathematical models of computing machines. The language formalisms discussed include regular, context-free, context-sensitive, and recursively enumerable languages. The machines discussed include finite-state, pushdown and linear bounded automata and Turing machines.

MAJOR READINGS

Thomas Sudkamp, LANGUAGES AND MACHINES

EXAMINATIONS AND ASSIGNMENTS

To be announced

Unless preregistered students attend the first class meeting or communicate directly with the instructor prior to the first class, they will be dropped from the class list. NOTE: Students must still submit a completed Drop/Add form to the Registrar's Office.

COURSE FORMAT: Lecture

REGISTRATION INFORMATION

Level: UGRD    Credit: 1    Gen Ed Area Dept: NONE    Grading Mode: Graded   

Prerequisites: MATH228

SECTION 01

Instructor(s): Dougherty Jr,Daniel J.   
Instructor's Course Page
Times: ..T.T.. 01:10PM-02:30PM;     Location: SCIE618
Reserved Seats:    (Total Limit: UNL)
SR. major:    Jr. major:
SR. non-major:    Jr. non-major:    SO:    FR:

Special Attributes:
Curricular Renewal:    Quantitative Reasoning
Links to Web Resources For This Course.

Last Updated on MAR-26-2001


Contact wesmaps@wesleyan.edu to submit comments or suggestions. Please include a url, course title, faculty name or other page reference in your email

Copyright Wesleyan University, Middletown, Connecticut, 06459