arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 0706.0431cs.DMmath.CO
收藏

有界语言上的抽象数制与常数乘法

Abstract numeration systems on bounded languages and multiplication by a constant

Emilie Charlier, Michel Rigo, Wolfgang Steiner

摘要:

如果由其元素的表示组成的语言被有限自动机接受,则一组整数是$S$ -在抽象记数系统$S$中可识别的。对于建立在至少有三个字母的有界语言的抽象计数系统,我们表明,乘一个整数$λ\ge2$不保留$S$ -recognizability,这意味着总是存在一个$S$ -可识别的集合$X$,使$λX$是不$S$ -可识别的。主要工具是一个有界语言上的整数表示和它的分解之间的双射,作为具有某些属性的二项式系数的总和,即所谓的组合计数系统。

英文摘要:

A set of integers is $S$-recognizable in an abstract numeration system $S$ if the language made up of the representations of its elements is accepted by a finite automaton. For abstract numeration systems built over bounded languages with at least three letters, we show that multiplication by an integer $λ\ge2$ does not preserve $S$-recognizability, meaning that there always exists a $S$-recognizable set $X$ such that $λX$ is not $S$-recognizable. The main tool is a bijection between the representation of an integer over a bounded language and its decomposition as a sum of binomial coefficients with certain properties, the so-called combinatorial numeration system.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑