Greedy numeration systems and regularity

DOI10.1007/s002240000082zbMath0895.68088OpenAlexW1971464758MaRDI QIDQ1386650

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

numeration systemsregular languagesdominant 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)

Related Items (16)

Beta-expansion of 1 for quartic Pisot units ⋮ On multiplicatively dependent linear numeration systems, and periodic points ⋮ Ultimate periodicity problem for linear numeration systems ⋮ A full characterization of Bertrand numeration systems ⋮ Real numbers having ultimately periodic representations in abstract numeration systems ⋮ Alternate Base Numeration Systems ⋮ String Attractors of Fixed Points of k-Bonacci-Like Morphisms ⋮ First-Order Logic and Numeration Systems ⋮ Automatic sequences based on Parry or Bertrand numeration systems ⋮ The self-affine property of \((U,r)\)-Carlitz sequences of polynomials deciphered in terms of graph directed IFS ⋮ Self-generating sets, integers with missing blocks, and substitutions ⋮ A Decision Problem for Ultimately Periodic Sets in Non-standard Numeration Systems ⋮ Numeration systems on a regular language: Arithmetic operations, recognizability and formal power series ⋮ A Probabilistic Approach to Generalized Zeckendorf Decompositions ⋮ A DECISION PROBLEM FOR ULTIMATELY PERIODIC SETS IN NONSTANDARD NUMERATION SYSTEMS ⋮ Generalization of automatic sequences for numeration systems on a regular language

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