WesMaps - Wesleyan University Catalog 2007-2008       Summer Session       Winter Session       Home       Archive       Search
CS92PROD
Automata Theory and Formal Languages
COMP 301
Fall 2007
Section: 01  
Crosslisting: 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.

Essential Capabilities: None
Credit: 1 Gen Ed Area Dept: None
Course Format: LectureGrading Mode: Graded
Level: UGRD Prerequisites: MATH228
Fulfills a Major Requirement for: (COMP)(IDEA-MN)(IDEA-EE)(INFO-MN)(MATH)(NS&B)(STS)
Past Enrollment Probability: Not Available

Last Updated on JUN-19-2024
Contact wesmaps@wesleyan.edu to submit comments or suggestions. Please include a url, course title, faculty name or other page reference in your email ? Wesleyan University, Middletown, Connecticut, 06459