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

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.

EXAMINATIONS AND ASSIGNMENTS

COURSE FORMAT: Lecture

REGISTRATION INFORMATION

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

Prerequisites: MATH228

SECTION 01

Instructor(s): Aaron,Eric G.   

Times: .M.W... 02:40PM-04:00PM;     Location: SCIE137;

Reserved Seats:    (Total Limit: 25)

SR. major: 0   Jr. major: 0

SR. non-major: 10   Jr. non-major: 10   SO: 5   FR: 0

Special Attributes:

Curricular Renewal:    Quantitative Reasoning

Last Updated on MAR-30-2006

Copyright Wesleyan University, Middletown, Connecticut, 06459