Context sensitive language can be recognized by a:

Concept:

A grammar G = (V, T, S, P) is said to be context sensitive if all productions are of the form x → y where x, y, belongs to (V U T)⁺ and |x| ≤ | y|.

Languages that are generates from context sensitive grammar is known as context sensitive languages.

Relation between languages and their automaton.

Explanation:

• Context sensitive languages are recognized with the help of linear bounded automata. A linear bounded automaton has an unbounded tape, but usable part of the tape is restricted as compared to Turing machine.
•  In linear bounded automata, there are two end markers [ left end marker, right end marker ]. Read write head cannot move to the left or right of these markers.

Language L = {aⁿ bⁿ cⁿ: n > = 1}

• It is accepted by linear bounded automata. It is a context sensitive language. A push down automata cannot accept this language.