[Wesleyan Home Page]
[Wesmaps Home Page]
[Availability Statistics Search]
[Course Description Search]
[Dept. Search]
COMP301
Automata Theory And Formal Languages
COMP301 SP
Spring 97 Availability (Last Updated on Thu Apr 17 05:00:17 EDT 1997
)
Section Limit Enrollment Available
01 999 0 Open
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
COURSE FORMAT: Lecture
REGISTRATION INFORMATION
Level: UG Credit: 1.00
Prerequisites:
COMP212 and MATH228
- Section 01
- Subrahmanyam, R
- Times: .T.T... 2:40PM;
- Grading Mode: A/F
- Registration Preference (1 high to 6 low, 0=Excluded) Sr: 1, Jr: 1, So: 1, Fr: 1
- No Major Preference Given
Last Updated on MAR-10-1997
Contact wesmaps@wesleyan.edu to
submit comments or suggestions.
Copyright Wesleyan University, Middletown, Connecticut, 06459