Dissecting power of intersection of two context-free languages
Josef Rukavicka

TL;DR
This paper demonstrates that geometrically growing languages can be dissected by homomorphic images of intersections of two context-free languages, extending previous results on dissecting constantly growing languages.
Contribution
It introduces a method to dissect geometrically growing languages using intersection of context-free languages and homomorphisms, broadening the scope of dissecting language classes.
Findings
Existence of specific context-free languages $M_1, M_2$
Construction of homomorphisms $ heta, ho$
Dissection of geometrically growing languages by these constructs
Abstract
We say that a language is \emph{constantly growing} if there is a constant such that for every word there is a word with . We say that a language is \emph{geometrically growing} if there is a constant such that for every word there is a word with . Given two infinite languages , we say that \emph{dissects} if and . In 2013, it was shown that for every constantly growing language there is a regular language such that dissects . In the current article we show how to dissect a geometrically growing language by a homomorphic image of intersection of two context-free languages. Consider three alphabets , , and such that…
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
