关于有理数基数系统中的有理数集
On sets of numbers rationally represented in a rational base number system
摘要:
本文证明了一个在加法下闭的数集,如果它在有理基数制中的表示是有理语言,它就不是一个可加幺半群。证明的一个关键是语言的一个强组合性质的定义:有界左迭代性质。它既是通常形式语言理论中的一个不自然的属性(因为它与任何类型的泵引理相矛盾),也是通过有理基数系统定义的语言的理想拟合。
英文摘要:
In this work, it is proved that a set of numbers closed under addition and whose representations in a rational base numeration system is a rational language is not a finitely generated additive monoid. A key to the proof is the definition of a strong combinatorial property on languages : the bounded left iteration property. It is both an unnatural property in usual formal language theory (as it contradicts any kind of pumping lemma) and an ideal fit to the languages defined through rational base number systems.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。