[WesMaps Home Page]
[Course Search]
[Course Search by CID]
COMP301
Automata Theory And Formal Languages
COMP301 FA
| Section | Class Size | *Available | Times |
|---|
| 1 | 49 | 989 | Times: M.W.F.. 11:00AM-11:50AM; |
*The number of spaces listed as available is based on class seats open for
the current phase of registration. Some seats may be taken in previous
phases while others may be held out for subsequent phases of registration.
(Last Updated on Wed Mar 4 05:01:03 EST 1998
)
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
- Yancey, W
- Times: M.W.F.. 11:00AM-11:50AM;
- 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-03-1998
Contact wesmaps@wesleyan.edu to
submit comments or suggestions.
Copyright Wesleyan University, Middletown, Connecticut, 06459