Negative bases and automata - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Discrete Mathematics and Theoretical Computer Science Year : 2011

Negative bases and automata

Abstract

We study expansions in non-integer negative base -beta introduced by Ito and Sadahiro. Using countable automata associated with (-beta)-expansions, we characterize the case where the (-beta)-shift is a system of finite type. We prove that, if beta is a Pisot number, then the (-beta)-shift is a sofic system. In that case, addition (and more generally normalization on any alphabet) is realizable by a finite transducer. We then give an on-line algorithm for the conversion from positive base beta to negative base -beta. When beta is a Pisot number, the conversion can be realized by a finite on-line transducer.
Fichier principal
Vignette du fichier
1783-5973-1-PB.pdf (180.27 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-00990484 , version 1 (13-05-2014)

Identifiers

Cite

Christiane Frougny, Anna Chiara Lai. Negative bases and automata. Discrete Mathematics and Theoretical Computer Science, 2011, Vol. 13 no. 1 (1), pp.75--94. ⟨10.46298/dmtcs.538⟩. ⟨hal-00990484⟩
67 View
770 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More