[ Wesleyan Home Page ] [ WesMaps Home Page ] [ Course Search ] [ Course Search by CID ]

Automata Theory And Formal Languages
COMP301 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

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): Lang,Frederic    

Instructor's Course Page

Times: ..T.T.. 01:10PM-02:30PM;     Location: SCIE139

Reserved Seats:    (Total Limit: 20)

SR. major:    Jr. major:

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

Special Attributes:

Curricular Renewal:    Quantitative Reasoning

Last Updated on MAR-24-2000

Copyright Wesleyan University, Middletown, Connecticut, 06459