arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2609.13871cs.FL

关于 Kanazawa--Salvati 猜想

On the Kanazawa--Salvati Conjecture

Takao Yuyama

首次发表
浏览论文内容

中文总结 AI 辅助

该研究将 Kanazawa--Salvati 猜想归结为显式组合问题,构造良嵌套多重上下文无关文法族,证明四字母类比 MIX_4 非此类语言,但原猜想仍开放。

中文摘要 AI 辅助

语言 $\mathrm{MIX}$ 由三字母字母表上每个字母出现次数相等的所有单词组成。它也是 $\mathbb{Z}^2$ 关于适当选择的生成元的字问题。Kanazawa--Salvati 猜想断言 $\mathrm{MIX}$ 不是良嵌套多重上下文无关语言。每个良嵌套多重上下文无关语言都是索引语言。我们将该猜想归结为一个关于单词元组的显式组合问题,该问题比以任意良嵌套多重上下文无关文法表述的原始形式更容易陈述。更一般地,对于每个满射幺半群同态 $\psi\colon \Sigma^* \to \mathbb{Z}^d$,我们定义一族良嵌套多重上下文无关文法 $G_\psi[r]$($r \geq 1$),每个文法生成 $\psi^{-1}(\mathbf{0})$ 的一个子语言。我们证明 $\psi^{-1}(\mathbf{0})$ 的每个良嵌套多重上下文无关子语言都包含在某个 $r \geq 1$ 的 $L(G_\psi[r])$ 中。利用这一族文法,我们证明四字母类比 $\mathrm{MIX}_4$(即 $\mathbb{Z}^3$ 的字问题)不是良嵌套多重上下文无关语言。该证明将此断言归结为 Bishop--Elder--Evetts--Gallot--Levine 的一个结果,该结果指出两字母类比 $\mathrm{MIX}_2$ 不由任何非分支多重上下文无关文法生成。Kanazawa--Salvati 猜想本身仍然开放。

英文摘要

The language $\mathrm{MIX}$ consists of all words over a three-letter alphabet that have an equal number of occurrences of each letter. It is also the word problem of $\mathbb{Z}^2$ with respect to a suitable choice of generators. The Kanazawa--Salvati conjecture states that $\mathrm{MIX}$ is not a well-nested multiple context-free language. Every well-nested multiple context-free language is an indexed language. We reduce the conjecture to an explicit combinatorial problem about tuples of words, which is easier to state than the original formulation in terms of arbitrary well-nested multiple context-free grammars. More generally, for every surjective monoid homomorphism $ψ\colon Σ^* \to \mathbb{Z}^d$, we define a family of well-nested multiple context-free grammars $G_ψ[r]$ for $r \geq 1$, each of which generates a sublanguage of $ψ^{-1}(\mathbf{0})$. We prove that every well-nested multiple context-free sublanguage of $ψ^{-1}(\mathbf{0})$ is contained in $L(G_ψ[r])$ for some $r \geq 1$. Using this family, we prove that the four-letter analogue $\mathrm{MIX}_4$, which is a word problem of $\mathbb{Z}^3$, is not a well-nested multiple context-free language. The proof reduces this claim to a result of Bishop--Elder--Evetts--Gallot--Levine stating that the two-letter analogue $\mathrm{MIX}_2$ is not generated by any non-branching multiple context-free grammar. The Kanazawa--Salvati conjecture itself remains open.

发表机构

  • ZEN University(禅大学)

机构由 AI 辅助整理,请以论文原文为准。

补充信息

↑