One-Sided and Two-Sided Context in Formal Grammars

A proof for the equivalence of context-sensitive and one-sided contextsensitive languages is given. This yields as a corollary the normal form A → BC, AB → AC, A → a for context-sensitive grammars.

[1]  György E. Révész.  Comment on the Paper "Error Detection in Formal Languages" , 1974, Journal of computer and system sciences (Print).

[2]  S.-Y. Kuroda,et al.  Classes of Languages and Linear-Bounded Automata , 1964, Inf. Control..

[3]  I. N. Sneddon,et al.  Theory Of Automata , 1969 .