Table of Contents
Fetching ...

Dissecting power of intersection of two context-free languages

Josef Rukavicka

TL;DR

The paper addresses the problem of dissecting infinite languages by leveraging intersections of two context-free languages to dissect geometrically growing languages. It introduces balanced extended non-associative words, obtained as $ENW\cap BAL$, and reduces geometric growth to a constant-growth framework via a homomorphic image, culminating in a theorem that there exist $M_1,M_2\subseteq \Theta^*$, an erasing homomorphism $\pi$, and a nonerasing homomorphism $\varphi$ such that for any geometrically growing $L\subseteq \Gamma^*$, a regular $R\subseteq \Theta^*$ yields $\varphi^{-1}(\pi(R\cap M_1\cap M_2))$ that dissects $L$. This generalizes REG-dissectibility to geometrically growing languages and ties dissectibility to i-separation, enabling a broader framework for studying $\mathrm{CFL}$-based dissections and suggesting further exploration of hiCFL and growth notions. The construction leverages Catalan-structure insights to relate word height to $z$-occurrence, enabling a controlled translation from geometric growth to regular witnesses.

Abstract

We say that a language $L$ is \emph{constantly growing} if there is a constant $c$ such that for every word $u\in L$ there is a word $v\in L$ with $\vert u\vert<\vert v\vert\leq c+\vert u\vert$. We say that a language $L$ is \emph{geometrically growing} if there is a constant $c$ such that for every word $u\in L$ there is a word $v\in L$ with $\vert u\vert<\vert v\vert\leq c\vert u\vert$. Given two infinite languages $L_1,L_2$, we say that $L_1$ \emph{dissects} $L_2$ if $\vert L_2\setminus L_1\vert=\infty$ and $\vert L_1\cap L_2\vert=\infty$. In 2013, it was shown that for every constantly growing language $L$ there is a regular language $R$ such that $R$ dissects $L$. 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 $\vert Σ\vert=1$ and $\vert Θ\vert=4$. We prove that there are context-free languages $M_1,M_2\subseteq Θ^*$, an erasing alphabetical homomorphism $π:Θ^*\rightarrow Σ^*$, and a nonerasing alphabetical homomorphism $\varphi : Γ^*\rightarrow Σ^*$ such that: If $L\subseteq Γ^*$ is a geometrically growing language then there is a regular language $R\subseteq Θ^*$ such that $\varphi^{-1}\left(π\left(R\cap M_1\cap M_2\right)\right)$ dissects the language $L$.

Dissecting power of intersection of two context-free languages

TL;DR

The paper addresses the problem of dissecting infinite languages by leveraging intersections of two context-free languages to dissect geometrically growing languages. It introduces balanced extended non-associative words, obtained as , and reduces geometric growth to a constant-growth framework via a homomorphic image, culminating in a theorem that there exist , an erasing homomorphism , and a nonerasing homomorphism such that for any geometrically growing , a regular yields that dissects . This generalizes REG-dissectibility to geometrically growing languages and ties dissectibility to i-separation, enabling a broader framework for studying -based dissections and suggesting further exploration of hiCFL and growth notions. The construction leverages Catalan-structure insights to relate word height to -occurrence, enabling a controlled translation from geometric growth to regular witnesses.

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 and . We prove that there are context-free languages , an erasing alphabetical homomorphism , and a nonerasing alphabetical homomorphism such that: If is a geometrically growing language then there is a regular language such that dissects the language .

Paper Structure

This paper contains 6 sections, 12 theorems, 22 equations.

Key Result

Lemma 1.1

(see YAMAKAMI2013116) Let $\mathcal{A}$ and $\mathcal{B}$ be any two language families and assume that $\mathcal{A}-\mathcal{B}$ is $\mathop{\mathrm{REG}}\nolimits$-dissectible. It then holds that, for any $A\in\mathcal{A}$ and any $B\in\mathcal{B}$, if $A$ i-covers $B$, then there exists a language

Theorems & Definitions (28)

  • Lemma 1.1
  • Theorem 1.2
  • Corollary 1.3
  • proof
  • Remark 1.4
  • Remark 3.1
  • Remark 3.2
  • Lemma 3.3
  • proof
  • Remark 3.4
  • ...and 18 more