February 2022
Beginner to intermediate
572 pages
13h
English
Between the restricted, context-free grammars and the general, unrestricted grammars, a great variety of “somewhat restricted” grammars can be defined. Not all cases yield interesting results; among the ones that do, the context-sensitive grammars have received considerable attention. These grammars generate languages associated with a restricted class of Turing machines, linear bounded automata, which we introduced in Section 10.5.
This definition shows clearly one aspect of this type of grammar; it is noncontracting, in the sense ...
Read now
Unlock full access