unrestricted confusion
Here's the link to the template on wikipedia
that describes the chomsky hierarchy.
The problem is that the (unrestricted) category
under languages must describe two different sets.
The current author implies in his comment that
the parens make this OK. It wasn't obvious to
us. In fact, we like the previous revision better,
that had "Unrestricted" corresponding to "Turing machine".
Is "Unrestricted" a valid Grammar? The "Formal languages"
page seems to define it, so we think yes.
Jim want to just leave the other lines blank, like this
chomsky grammar language automata
type-0 Unrestricted Recursive enum Turing
Recursive Decider
type-1 Context sens. Contex sens. Linear bound
type-2 Context free Context free Pushdown
type-3 Regular Regular Finite state
