[ Wesleyan Home Page ] [ WesMaps Home Page ] [ WesMaps Archive ] [ Course Search ] [ Course Search by CID ]
Academic Year 2004/2005

Automata Theory and Formal Languages
COMP 301 SP
Crosslistings:
COMP 500

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

Lewis and Papadimitriou, ELEMENTS OF THE THEORY OF COMPUTATION

EXAMINATIONS AND ASSIGNMENTS

To be announced

ADDITIONAL REQUIREMENTS and/or COMMENTS

Additional Requirements and/or Comments not known

COURSE FORMAT: Lecture

REGISTRATION INFORMATION

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

Prerequisites: MATH228 Links to Web Resources For This Course.

Last Updated on MAR-21-2005

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