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