Abstract
We study expansions in non-integer negative base -β introduced by Ito and Sadahiro [7]. Using countable automata associated with (β)-expansions, we characterize the case where the (;β)-shift is a system of finite type. We prove that, if β is a Pisot number, then the (;β)-shift is a sofic system. In that case, addition (and more generally normalization on any alphabet) is realizable by a finite transducer. © 2009 Springer Berlin Heidelberg.
Cite
CITATION STYLE
Frougny, C., & Lai, A. C. (2009). On negative bases. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5583 LNCS, pp. 252–263). https://doi.org/10.1007/978-3-642-02737-6_20
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
