WesMaps - Wesleyan University Catalog 2018-2019       Home       Archive       Search
Automata Theory and Formal Languages
COMP 301
Fall 2018
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.
Credit: 1 Gen Ed Area Dept: NSM MATH
Course Format: LectureGrading Mode: Graded
Level: UGRD Prerequisites: COMP211 AND COMP212 AND MATH228
Fulfills a Major Requirement for: (COMP)(MATH)(NS&B)
Past Enrollment Probability: 75% - 89%

Last Updated on MAR-26-2019
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