Substitutions and \(\beta\) systems of numeration

DOI10.1016/0304-3975(95)91132-AzbMath0872.11017OpenAlexW2476684363MaRDI QIDQ674336

Stéphane Fabre

Publication date: 28 February 1997

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(95)91132-a

zbMATH Keywords

numeration systemssubstitutionautomatic sequenceCobham's theorem

Mathematics Subject Classification ID

Automata sequences (11B85) Other number representations (11A67) Discrete mathematics in relation to computer science (68R99)

Related Items (30)

Dynamical directions in numeration ⋮ Palindromic complexity of infinite words associated with simple Parry numbers ⋮ Diffraction spectra of weighted Delone sets on beta-lattices with beta a quadratic unitary Pisot number ⋮ On gaps in Rényi \(\beta\)-expansions of unity for \(\beta>1\) an algebraic number ⋮ On the structure of (−β)-integers ⋮ Continued fractions and numeration in the Fibonacci base ⋮ Complexity of infinite words associated with beta-expansions ⋮ Mixing properties and entropy bounds of a family of Pisot random substitutions ⋮ Symmetry groups for beta-lattices ⋮ Additive and multiplicative properties of point sets based on beta-integers. ⋮ String Attractors of Fixed Points of k-Bonacci-Like Morphisms ⋮ Arithmetics in numeration systems with negative quadratic base ⋮ Numbers with integer expansion in the numeration system with negative base ⋮ Abelian complexity of infinite words associated with quadratic Parry numbers ⋮ Abelian properties of Parry words ⋮ On a class of infinite words with affine factor complexity ⋮ Purely periodic \(\beta \)-expansions in the Pisot non-unit case ⋮ Symmetrized \(\beta \)-integers ⋮ Tilings for Pisot beta numeration ⋮ Automatic sequences based on Parry or Bertrand numeration systems ⋮ Combinatorial and arithmetical properties of infinite words associated with non-simple quadratic Parry numbers ⋮ Balances and Abelian Complexity of a Certain Class of Infinite Ternary Words ⋮ Confluent Parry numbers, their spectra, and integers in positive- and negative-base number systems ⋮ Repetitions in beta-integers ⋮ Substitutive number systems ⋮ Sequences with constant number of return words ⋮ Asymptotic behavior of beta-integers ⋮ On recognizable sets of integers ⋮ A note on symmetries in the Rauzy graph and factor frequencies ⋮ SUBSTITUTIONS OVER INFINITE ALPHABET GENERATING (−β)-INTEGERS

Cites Work

• A generalization of automatic sequences
• Representations for real numbers and their ergodic properties
• On theβ-expansions of real numbers
• Uniform tag sequences
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Substitutions and \(\beta\) systems of numeration