|
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.
Unless preregistered students attend the first class meeting or communicate directly with the instructor prior to the first class, they will be dropped from the class list. NOTE: Students must still submit a completed Drop/Add form to the Registrar's Office.
COURSE FORMAT: Lecture
Level: UGRD Credit: 1 Gen Ed Area Dept: NONE Grading Mode: Graded
Prerequisites: MATH228
Last Updated on MAR-26-2001
Copyright Wesleyan University, Middletown, Connecticut, 06459