Spectrum, algebraicity and normalization in alternate bases
\'Emilie Charlier, C\'elia Cisternino, Zuzana Mas\'akov\'a, Edita, Pelantov\'a

TL;DR
This paper investigates the algebraic properties of alternate bases for number systems, establishing conditions for sofic systems and showing that normalization can be achieved with finite automata when certain algebraic criteria are met.
Contribution
It provides necessary and sufficient algebraic conditions for soficity of alternate base systems and constructs finite automata for normalization under these conditions.
Findings
Necessary condition: product of bases is an algebraic integer.
Sufficient condition: product is a Pisot number and bases are in its field.
Normalization is computable by a finite automaton when conditions are met.
Abstract
The first aim of this article is to give information about the algebraic properties of alternate bases determining sofic systems. We show that a necessary condition is that the product is an algebraic integer and all of the bases belong to the algebraic field . On the other hand, we also give a sufficient condition: if is a Pisot number and , then the system associated with the alternate base is sofic. The second aim of this paper is to provide an analogy of Frougny's result concerning normalization of real bases representations. We show that given an alternate base such that is a Pisot…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
Topicssemigroups and automata theory · Computability, Logic, AI Algorithms · Logic, programming, and type systems
