On recognizable sets of integers
type: Item
instance of: scholarly article
title: On recognizable sets of integers
zbMATH Open document ID: 1046.11500
author: Fabien Durand
published in: Journal de Théorie des Nombres de Bordeaux
publication date: 1999-06-23T00:00:00Z
full work available at URL: http://www.numdam.org/item
full work available at URL: https://eudml.org/doc/228439
full work available at URL: jtnb1998-1.html
Mathematics Subject Classification ID: 11B85
zbMATH DE Number: 1229648
MaRDI profile type: Publication
OpenAlex ID: W2963045707
cites work: 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
cites work: How to write integers in a non-integral basis
cites work: An extension of the Cobham-Semënov Theorem
cites work: Recognizable sets of numbers in nonstandard bases
cites work: Bertrand numeration systems and recognizability
cites work: Logic and \(p\)-recognizable sets of integers
cites work: On the Cobham-Semenov theorem
cites work: Suites algébriques, automates et substitutions
cites work: On the base-dependence of sets of numbers recognizable by finite automata
cites work: Uniform tag sequences
cites work: A characterization of substitutive sequences using return words
cites work: A generalization of Cobham's theorem
cites work: Substitutional dynamical systems, Bratteli diagrams and dimension groups
cites work: Q4079524
cites work: Une généralisation du théorème de Cobham
cites work: Substitutions and \(\beta\) systems of numeration
cites work: On the factors of automatic words
cites work: Independent numeration systems and syndeticity
cites work: An Introduction to Symbolic Dynamics and Coding
cites work: Presburger arithmetic and recognizability of sets of natural numbers by automata: New proofs of Cobham's and Semenov's theorems
cites work: Power of words and recognizability of fixpoints of a substitution
cites work: Complexité des facteurs des mots infinis engendrés par morphismes itérés
cites work: On theβ-expansions of real numbers
cites work: Substitution dynamical systems - spectral analysis
cites work: Presburgerness of predicates regular in two number systems
cites work: A generalization of automatic sequences
DOI: 10.5802/JTNB.219
Recommended article: Characterizing simpler recognizable sets of integers
Recommended article: Q4708608
Recommended article: Q5778634
Recommended article: Q5337293
Recommended article: Recognizable sets of numbers in nonstandard bases
Recommended article: Q3217583
Recommended article: Q4058736
Recommended article: Q3470561
Recommended article: Q5785788
Recommended article: On certain other sets of integers
description: scientific article; zbMATH DE number 1229648