In formal language theory, a noncontracting grammar is in Kuroda normal form if all production rules are of the form:[1]

AB → CD or
A → BC or
A → B or
A → a

where A, B, C and D are nonterminal symbols and a is a terminal symbol.[1] Some sources omit the A → B pattern.[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.[3]

Every grammar in Kuroda normal form is noncontracting, and therefore, generates a context-sensitive language. 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. This proves that every noncontracting grammar generates a context-sensitive language.[1]

There is a similar normal form for unrestricted grammars as well, which at least some authors call "Kuroda normal form" too:[4]

AB → CD or
A → BC or
A → a or
A → ε

where ε is the empty string. Every unrestricted grammar is weakly equivalent to one using only productions of this form.[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.[4] Similarly, for context-sensitive grammars, the Penttonen normal form, also called the one-sided normal form (following Penttonen's own terminology) is:[1][2]

AB → AD or
A → BC or
A → a

For every context-sensitive grammar, there exists a weakly equivalent one-sided normal form.[2]

See also

References

  1. 1 2 3 4 Masami Ito; Yūji Kobayashi; Kunitaka Shoji (2010). Automata, Formal Languages and Algebraic Systems: Proceedings of AFLAS 2008, Kyoto, Japan, 20-22 September 2008. World Scientific. p. 182. ISBN 978-981-4317-60-3.
  2. 1 2 3 4 5 Mateescu, Alexandru; Salomaa, Arto (1997). "Chapter 4: Aspects of Classical Language Theory". In Rozenberg, Grzegorz; Salomaa, Arto (eds.). Handbook of Formal Languages. Volume I: Word, language, grammar. Springer-Verlag. p. 190. ISBN 978-3-540-61486-9.
  3. ↑ Willem J. M. Levelt (2008). An Introduction to the Theory of Formal Languages and Automata. John Benjamins Publishing. pp. 126–127. ISBN 978-90-272-3250-2.
  4. 1 2 Alexander Meduna (2000). Automata and Languages: Theory and Applications. Springer Science & Business Media. p. 722. ISBN 978-1-85233-074-3.
  5. ↑ Alexander Meduna (2000). Automata and Languages: Theory and Applications. Springer Science & Business Media. p. 728. ISBN 978-1-85233-074-3.

Further reading

This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.