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.
Unable to display preview. Download preview PDF.
- 3.Frougny, C., Sakarovitch, J.: Number representation and finite automata. In: Berthé, V., Rigo, M. (eds.) Combinatorics, Automata and Number Theory. Encyclopedia of Mathematics and its Applications, vol. 135, pp. 34–107. Cambridge Univ. Press (2010)Google Scholar
- 5.Hopcroft, J.E., Motwani, R., Ullman, J.D.: Introduction to Automata Theory, Languages and Computation. Addison-Wesley (2000)Google Scholar
- 6.Lecomte, P., Rigo, M.: Abstract numeration systems. In: Berthé, V., Rigo, M. (eds.) Combinatorics, Automata and Number Theory. Encyclopedia of Mathematics and its Applications, vol. 135, pp. 108–162. Cambridge Univ. Press (2010)Google Scholar
- 7.Lothaire, M.: Algebraic Combinatorics on Words. Cambridge University Press (2002)Google Scholar
- 8.Sakarovitch, J.: Elements of Automata Theory. Cambridge University Press (2009); Corrected English translation of Éléments de théorie des automates, Vuibert (2003)Google Scholar