Independent numeration systems and syndeticity

DOI10.1016/S0304-3975(98)00035-8zbMath0952.68073OpenAlexW2482394447MaRDI QIDQ1275464

Georges Hansel

Publication date: 12 January 1999

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

Full work available at URL: https://doi.org/10.1016/s0304-3975(98)00035-8

zbMATH Keywords

numeration systemsfinite automatonCobham's theorem

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Radix representation; digital problems (11A63)

Related Items (8)

On multiplicatively dependent linear numeration systems, and periodic points ⋮ Syndeticity and independent substitutions ⋮ LOGICAL CHARACTERIZATION OF RECOGNIZABLE SETS OF POLYNOMIALS OVER A FINITE FIELD ⋮ Hybrid quasicrystals, transport and localization in products of minimal sets ⋮ An asymptotic version of Cobham’s theorem ⋮ An extension of the Cobham-Semënov Theorem ⋮ Self-similar tiling systems, topological factors and stretching factors ⋮ On recognizable sets of integers

Cites Work

• Unnamed Item
• Unnamed Item
• How to write integers in a non-integral basis
• Logic and \(p\)-recognizable sets of integers
• Bertrand numeration systems and recognizability
• Presburger arithmetic and recognizability of sets of natural numbers by automata: New proofs of Cobham's and Semenov's theorems
• An extension of the Cobham-Semënov Theorem
• On the base-dependence of sets of numbers recognizable by finite automata

This page was built for publication: Independent numeration systems and syndeticity