Skip to Main content Skip to Navigation
Journal articles

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.
Document type :
Journal articles
Complete list of metadata
Contributor : Service Ist Inria Sophia Antipolis-Méditerranée / I3s Connect in order to contact the contributor
Submitted on : Tuesday, May 13, 2014 - 3:39:11 PM
Last modification on : Friday, November 19, 2021 - 6:06:03 PM
Long-term archiving on: : Monday, April 10, 2017 - 10:09:24 PM


Files produced by the author(s)




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



Record views


Files downloads