Computability and Complexity/Formal Languages/Chomsky Hierarchy/Unrestricted Languages: Revision history

Jump to navigation Jump to search

Diff selection: Mark the radio buttons of the revisions to compare and hit enter or the button at the bottom.
Legend: (cur) = difference with latest revision, (prev) = difference with preceding revision, m = minor edit.

9 May 2007

  • curprev 22:1422:14, 9 May 2007 imported>DasBrose 11,454 bytes +11,454 New page: = Unrestricted Languages = As the name implies, the class of unrestricted languages is the least restrictive class in the Chomsky Hierarchy, and is the set of languages generated by unres...
Retrieved from "https://en-labs.wikimedia.beta.math.wmflabs.org/wiki/Computability_and_Complexity/Formal_Languages/Chomsky_Hierarchy/Unrestricted_Languages"