See also:

• Computers: Computer Science: Theoretical: Automata Theory: Linear Bounded Automata  (4)

• Context Sensitive Languages and Linear Bounded Automata - A set of slides defining these terms and showing that context sensitive languages are accepted by linear bounded automata.
• Context-sensitive Examples - Grammars for three context sensitive languages that are not context free. [PDF]
• Context-sensitive Language - A Wikipedia article which defines context sensitive languages in terms of context sensitive grammars which are defined in a linked article.
• Processing Natural and Formal Languages - Lecture notes from a course at the University of Edinburgh, covering processing natural and artificial languages.