Formal
Languages
and the
Theory of
Computation

Fall 2016
course
navigation

home

You've reached the home page of the Fall 2013 Formal Languages and the Theory of Computation course at Marlboro College.
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 ;
see wikipedia: Automata Theory
http://cs.marlboro.edu/ courses/ fall2016/formal_languages/ home
last modified Monday September 5 2016 2:51 pm EDT