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

Automata Theory and Formal Languages
COMP 301 FA
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.

EXAMINATIONS AND ASSIGNMENTS

To be announced

COURSE FORMAT: Lecture

REGISTRATION INFORMATION

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

Prerequisites: MATH228

SECTION 01

Instructor(s): Krizanc,David D   
Times: .M.W... 02:40PM-04:00PM;     Location: SCIE139
Reserved Seats:    (Total Limit: 25)
SR. major: 9   Jr. major: 8
SR. non-major: 4   Jr. non-major: 4   SO: 0   FR: 0

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

Last Updated on MAR-19-2004

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