Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
9657930 | Theoretical Computer Science | 2005 | 24 Pages |
Abstract
We generalize a result of Daróczy and Kátai, on the characterization of univoque numbers with respect to a non-integer base (Publ. Math. Debrecen 46(3-4) (1995) 385) by relaxing the digit alphabet to a generic set of real numbers. We apply the result to derive the construction of a Büchi automaton accepting all and only the greedy sequences for a given base and digit set. In the appendix, we prove a more general version of the fact that the expansion of an element xâQ(q) is ultimately periodic, if q is a Pisot number.
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Marco Pedicini,