Formal
Languages
and the
Theory of
Computation

Spring 2011
course
navigation

home

You've reached the home page of the Spring 2011 Formal Languages and the Theory of Computation course at Marlboro College.
This course ran previously in spring 2008 course; the material there may also be helpful.
grammar language automaton
Unrestricted Recursively enumerable Turing machine
Context sensitive Context sensitive Linear bounded
Context free Context free Nondeterministic pushdown
Regular Regular Finite state machine
Each line is a proper subset of the line directly above it.
Adapted from wikipedia:tempate:formal_languages_and_grammars
http://cs.marlboro.edu/ courses/ spring2011/formal_languages/ home
last modified Tuesday January 25 2011 6:06 pm EST