Greedy numeration systems and regularity

DOI10.1007/S002240000082MaRDI QIDQ1386650zbMATH OpenOpenAlexFDO

Authors Michael Israel Hollander

Publication date 8 September 1998

Published in Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s002240000082

zbMATH Keywords

regular languagesnumeration systemsdominant root propertygreedy numeration systems

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Radix representation; digital problems (11A63) Normal numbers, radix expansions, Pisot numbers, Salem numbers, good lattice points, etc. (11K16)

Recommendations

• Numeration systems, linear recurrences, and regular sets
• Numeration systems, linear recurrences, and regular sets
• \(\beta\)-shift, numeration systems, and automata

Cited in

(21)

• String Attractors of Fixed Points of k-Bonacci-Like Morphisms
• Sturmian graphs and integer representations over numeration systems
• The self-affine property of \((U,r)\)-Carlitz sequences of polynomials deciphered in terms of graph directed IFS
• Optimal number representations in negative base
• Automatic sequences based on Parry or Bertrand numeration systems
• First-order logic and numeration systems
• Real numbers having ultimately periodic representations in abstract numeration systems
• Generalization of automatic sequences for numeration systems on a regular language
• Self-generating sets, integers with missing blocks, and substitutions
• Numeration systems on a regular language: Arithmetic operations, recognizability and formal power series
• Ultimate periodicity problem for linear numeration systems
• A full characterization of Bertrand numeration systems
• A probabilistic approach to generalized Zeckendorf decompositions
• On the representation of real numbers using regular languages
• On multiplicatively dependent linear numeration systems, and periodic points
• Calculating the numbers of representations and the Garsia entropy in linear numeration systems
• Beta-expansion of 1 for quartic Pisot units
• A DECISION PROBLEM FOR ULTIMATELY PERIODIC SETS IN NONSTANDARD NUMERATION SYSTEMS
• Alternate Base Numeration Systems
• A Decision Problem for Ultimately Periodic Sets in Non-standard Numeration Systems
• Numeration systems, linear recurrences, and regular sets

This page was built for publication: Greedy numeration systems and regularity

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1386650)