WesMaps - Wesleyan University Catalog 2008-2009       Summer Session       Winter Session       Home       Archive       Search
Automata Theory and Formal Languages
COMP 301
Spring 2009
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: Logical Reasoning, Quantitative Reasoning
This course will focus on the creation of specific and general computational models and will train students in the mastery of their concrete and formal descriptions.
Credit: 1 Gen Ed Area Dept: None
Course Format: LectureGrading Mode: Graded
Level: UGRD Prerequisites: COMP211 AND MATH228
Fulfills a Major Requirement for: (COMP)(INFO-MN)(MATH)(NS&B)
Past Enrollment Probability: Not Available

Last Updated on MAR-22-2023
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