Normal forms for linear displacement context-free grammars
Alexey Sorokin

TL;DR
This paper establishes normal forms for linear displacement context-free grammars, providing foundational results that facilitate understanding and constructing such grammars, mainly serving educational and reference purposes.
Contribution
It introduces and proves several normal forms for linear displacement context-free grammars, aiding their theoretical understanding and practical application.
Findings
Normal forms for linear displacement context-free grammars are established.
Results are simple, using well-known techniques, but widely applicable.
The paper serves as an educational and referential resource.
Abstract
In this paper we prove several results on normal forms for linear displacement context-free grammars. The results themselves are rather simple and use well-known techniques, but they are extensively used in more complex constructions. Therefore this article mostly serves educational and referential purposes.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
Topicssemigroups and automata theory · DNA and Biological Computing · Cellular Automata and Applications
