# noncontracting grammarの例文

- This technique also proves that every
*noncontracting grammar* is context-sensitive. - None of the rules of a
*noncontracting grammar* decreases the length of the string that is being rewritten. - A formal language that can be described by a context-sensitive grammar, or, equivalently, by a
*noncontracting grammar* or a linear bounded automaton, is called a context-sensitive language. - If the possibility of adding the empty string to a language is added to the strings recognized by the
*noncontracting grammars* ( which can never include the empty string ) then the languages in these two definitions are identical. - Some definitions of a context-sensitive grammar only require that for any production rule of the form u ?! v, the length of u shall be less than or equal to the length of v . This seemingly weaker requirement is in fact weakly equivalent, see
*Noncontracting grammar* # Transforming into context-sensitive grammar.