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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
