Substitutions over infinite alphabet generating (−β)-integers

Daniel Dombek
(FNSPE, Czech Technical University in Prague)

This contribution is devoted to the study of positional numeration systems with negative base introduced by Ito and Sadahiro in 2009, called (−β)-expansions. We give an admissibility criterion for more general case of (−β)-expansions and discuss the properties of the set of (−β)-integers. We give a description of distances within this set and show that this set can be coded by an infinite word over an infinite alphabet, which is a fixed point of a non-erasing non-trivial morphism.

In Petr Ambrož, Štěpán Holub and Zuzana Masáková: Proceedings 8th International Conference Words 2011 (WORDS 2011), Prague, Czech Republic, 12-16th September 2011, Electronic Proceedings in Theoretical Computer Science 63, pp. 115–121.
Published: 17th August 2011.

ArXived at: http://dx.doi.org/10.4204/EPTCS.63.16 bibtex PDF
References in reconstructed bibtex, XML and HTML format (approximated).
Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org