Lattice theory is used to prove that these systems output a Boolean algebra isomorphic to the ones generated by Turing Machines.
Lattice theory is used to prove that these systems output a Boolean algebra isomorphic to the ones generated by Turing Machines. John Myhill devised the first deterministic machines that accepts the class of these systems, though it was Lawrence Landweber who first proved the result about acceptance. One of two results named the Immerman-Szelepcsenyi theorem holds that these systems are closed under the complement operation. These systems can be made lambda free by writing them in Kuroda normal form. They are equivalent in power to a version of Turing Machines that employ left and right angle bracket symbols called linear bounded automata. They correspond to Type-1 languages on the Chomsky Hierarchy. The defining characteristic of these non-contractile systems is that the left-hand side of a production rule mayhave terminals and non-terminals. For 10 points, name these grammars that can be used to define more languages than context-free languages.
Lattice theory is used to prove that these systems output a Boolean algebra isomorphic to the ones generated by Turing Machines.
context-sensitive languages [or context-senstive grammars; or   indexed languages until "indexed" is read; accept  linear bounded automata or linear bounded automaton until ―Kuroda‖]