 The strings formula_4 and formula_5 may be empty, but formula_6 must be nonempty.The rule formula_10 is allowed if formula_11 does not appear on the right side of any rule.The languages described by these grammars are exactly all languages that can be recognized by a linear bounded automaton (a nondeterministic Turing machine whose tape is bounded by a constant times the length of the input.)