You've reached the home page of the Fall 2019 Formal Languages and the Theory of Computation course at Marlboro College.
Intro meeting : Wed Sep 4 10:30am in Sci 217.
| 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 |
|||
