Context Sensitive Grammar

Grammars that have rules of the form:

$$\alpha A\beta \to \alpha \gamma \beta$$

With:

• $A$ as Non-terminal
• $\alpha ,\beta ,\gamma$ String of Terminals or Non-terminal with $\gamma$ non-empty Grammars can be recognizes with Linear Bounded Automata