User:Dhruvbird/0n1n0n

0n1n0n
0n1n0n is a Context-Sensitive Language (CSL).

Proof
This language can be easily proved to be not Context-Free by the use of the Pumping Lemma for Context-Free Languages. To prove so, we notice that there is NO way of spliting a string in the language into parts uvwxy such that |vx| ≥ 1 and |vwx| ≤ n (where 'n' is 2N and 'N' is the number of states in the PDA that recognizes the language).

To show that it is a Context-Sensitive Language (CSL), we notice that a Linear Bounded Automaton can accept this language and hence it must be Context-Sensitive.

Complement
The complement of every CSL is also a CSL. Hence, the complement of 0n1n0n is also a CSL.

Other Context-Sensitive Languages

 * ww
 * Language with equal number of 0s, 1s and 2s