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.
COURSE FORMAT: Lecture
Level: UG Credit: 1.00
Prerequisites: COMP212 and MATH228
Last Updated on MAR-22-1999
Copyright Wesleyan University, Middletown, Connecticut, 06459