[2] It is named after Sige-Yuki Kuroda, who originally called it a linear bounded grammar, a terminology that was also used by a few other authors thereafter.
Conversely, every noncontracting grammar that does not generate the empty string can be converted to Kuroda normal form.
[2] A straightforward technique attributed to György Révész transforms a grammar in Kuroda normal form to a context-sensitive grammar: AB → CD is replaced by four context-sensitive rules AB → AZ, AZ → WZ, WZ → WD and WD → CD.
[2] If the rule AB → CD is eliminated from the above, one obtains context-free grammars in Chomsky Normal Form.
[5] The Penttonen normal form (for unrestricted grammars) is a special case where first rule above is AB → AD.