Recognizable sets of numbers in nonstandard bases

DOI10.1007/3-540-59175-3_87OpenAlexW1580228111MaRDI QIDQ5096330

Véronique Bruyère, Georges Hansel

Publication date: 16 August 2022

Published in: LATIN '95: Theoretical Informatics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-59175-3_87

zbMATH Keywords

finite automatonnumeration systemrecognizable sets of natural numbers

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Automata and formal grammars in connection with logical questions (03D05) Other number representations (11A67)

Related Items (4)

Bertrand numeration systems and recognizability ⋮ Ostrowski-automatic sequences: theory and applications ⋮ Self-similar tiling systems, topological factors and stretching factors ⋮ On recognizable sets of integers

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• How to write integers in a non-integral basis
• A generalization of automatic sequences
• Logic and \(p\)-recognizable sets of integers
• On theβ-expansions of real numbers
• Weak Second‐Order Arithmetic and Finite Automata
• Systems of Numeration
• Développement en base $\theta$, répartition modulo un de la suite $(x\theta \sp n)$, n$\ge 0$, langages codés et $\theta$-shift
• Suites algébriques, automates et substitutions
• On the base-dependence of sets of numbers recognizable by finite automata
• Uniform tag sequences

This page was built for publication: Recognizable sets of numbers in nonstandard bases