WesMaps - Wesleyan University Catalog 2009-2010       Summer Session       Winter Session       Home       Archive       Search
CS92PROD
Automata Theory and Formal Languages
COMP 301
Spring 2010
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 will include regular, context-free, recursive, and recursively enumerable languages. The machine models discussed include finite-state automata, pushdown 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: NSM MATH
Course Format: LectureGrading Mode: Graded
Level: UGRD Prerequisites: COMP211 AND MATH228
Fulfills a Major Requirement for: (COMP)(MATH)(NS&B)
Past Enrollment Probability: Not Available

Last Updated on JAN-23-2022
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