A decision method for the recognizability of sets defined by number systems
RAIRO-Theor. Inf. Appl., 20 4 (1986) 395-403
Published online: 2017-02-01
Articles citing this article
The Citing articles tool gives a list of articles citing the current article.
The citing articles come from EDP Sciences database, as well as other publishers participating in CrossRef Cited-by Linking Program. You can set up your personal account to receive an email alert each time this article is cited by a new article (see the menu on the right-hand side of the abstract page).
Cited article:
This article has been cited by the following article(s):
Combinatorics on Words
Savinien Kreczman, Luca Prigioniero, Eric Rowland and Manon StipulantiLecture Notes in Computer Science, Combinatorics on Words 13899 206 (2023)
https://doi.org/10.1007/978-3-031-33180-0_16
Ultimate periodicity problem for linear numeration systems
É. Charlier, A. Massuir, M. Rigo and E. RowlandInternational Journal of Algebra and Computation 32 (03) 561 (2022)
https://doi.org/10.1142/S0218196722500254
Automata and finite order elements in the Nottingham group
Jakub Byszewski, Gunther Cornelissen and Djurre TijsmaJournal of Algebra 602 484 (2022)
https://doi.org/10.1016/j.jalgebra.2022.03.019
Substitutive Systems and a Finitary Version of Cobham’s Theorem
Jakub Byszewski, Jakub Konieczny and Elżbieta KrawczykCombinatorica 41 (6) 765 (2021)
https://doi.org/10.1007/s00493-020-4311-x
State Complexity of the Multiples of the Thue-Morse Set
Émilie Charlier, Célia Cisternino and Adeline MassuirElectronic Proceedings in Theoretical Computer Science 305 34 (2019)
https://doi.org/10.4204/EPTCS.305.3
Theory and Applications of Models of Computation
Arthur MilchiorLecture Notes in Computer Science, Theory and Applications of Models of Computation 10185 440 (2017)
https://doi.org/10.1007/978-3-319-55911-7_32
Periodicity of Morphic Words
I. V. MitrofanovJournal of Mathematical Sciences 206 (6) 679 (2015)
https://doi.org/10.1007/s10958-015-2344-2
https://doi.org/10.1002/9781119008200.biblio
https://doi.org/10.1002/9781119042853.biblio
Developments in Language Theory
Victor Marsault and Jacques SakarovitchLecture Notes in Computer Science, Developments in Language Theory 7907 362 (2013)
https://doi.org/10.1007/978-3-642-38771-5_32
Computer Science – Theory and Applications
Jeffrey ShallitLecture Notes in Computer Science, Computer Science – Theory and Applications 7913 49 (2013)
https://doi.org/10.1007/978-3-642-38536-0_5
Decidability of the HD0L ultimate periodicity problem
Fabien DurandRAIRO - Theoretical Informatics and Applications 47 (2) 201 (2013)
https://doi.org/10.1051/ita/2013035
AUTOMATIC THEOREM-PROVING IN COMBINATORICS ON WORDS
DANIEL GOČ, DANE HENSHALL and JEFFREY SHALLITInternational Journal of Foundations of Computer Science 24 (06) 781 (2013)
https://doi.org/10.1142/S0129054113400182
Implementation and Application of Automata
Daniel Goč, Dane Henshall and Jeffrey ShallitLecture Notes in Computer Science, Implementation and Application of Automata 7381 180 (2012)
https://doi.org/10.1007/978-3-642-31606-7_16
On vanishing coefficients of algebraic power series over fields of positive characteristic
Boris Adamczewski and Jason P. BellInventiones mathematicae 187 (2) 343 (2012)
https://doi.org/10.1007/s00222-011-0337-4
ENUMERATION AND DECIDABLE PROPERTIES OF AUTOMATIC SEQUENCES
ÉMILIE CHARLIER, NARAD RAMPERSAD and JEFFREY SHALLITInternational Journal of Foundations of Computer Science 23 (05) 1035 (2012)
https://doi.org/10.1142/S0129054112400448
Developments in Language Theory
Émilie Charlier, Narad Rampersad and Jeffrey ShallitLecture Notes in Computer Science, Developments in Language Theory 6795 165 (2011)
https://doi.org/10.1007/978-3-642-22321-1_15
Language and Automata Theory and Applications
Michel Rigo and Élise VandommeLecture Notes in Computer Science, Language and Automata Theory and Applications 6638 477 (2011)
https://doi.org/10.1007/978-3-642-21254-3_38
Language and Automata Theory and Applications
Narad RampersadLecture Notes in Computer Science, Language and Automata Theory and Applications 6638 65 (2011)
https://doi.org/10.1007/978-3-642-21254-3_4
Developments in Language Theory
Vesa Halava, Tero Harju, Tomi Kärki and Michel RigoLecture Notes in Computer Science, Developments in Language Theory 6224 209 (2010)
https://doi.org/10.1007/978-3-642-14455-4_20
A DECISION PROBLEM FOR ULTIMATELY PERIODIC SETS IN NONSTANDARD NUMERATION SYSTEMS
JASON BELL, EMILIE CHARLIER, AVIEZRI S. FRAENKEL and MICHEL RIGOInternational Journal of Algebra and Computation 19 (06) 809 (2009)
https://doi.org/10.1142/S0218196709005330
Periodicity, repetitions, and orbits of an automatic sequence
Jean-Paul Allouche, Narad Rampersad and Jeffrey ShallitTheoretical Computer Science 410 (30-32) 2795 (2009)
https://doi.org/10.1016/j.tcs.2009.02.006
Mathematical Foundations of Computer Science 2008
Emilie Charlier and Michel RigoLecture Notes in Computer Science, Mathematical Foundations of Computer Science 2008 5162 241 (2008)
https://doi.org/10.1007/978-3-540-85238-4_19
Developments in Language Theory
Jacques SakarovitchLecture Notes in Computer Science, Developments in Language Theory 4588 29 (2007)
https://doi.org/10.1007/978-3-540-73208-2_5
Decidability questions related to abstract numeration systems
Juha Honkala and Michel RigoDiscrete Mathematics 285 (1-3) 329 (2004)
https://doi.org/10.1016/j.disc.2004.05.004
On Number Systems with Finite Degree of Ambiguity
Juha HonkalaInformation and Computation 145 (1) 51 (1998)
https://doi.org/10.1006/inco.1998.2718
Automatic maps in exotic numeration systems
J. P. Allouche, E. Cateland, W. J. Gilbert, et al.Theory of Computing Systems 30 (3) 285 (1997)
https://doi.org/10.1007/BF02679463
J.UCS The Journal of Universal Computer Science
Juha HonkalaJ.UCS The Journal of Universal Computer Science 652 (1996)
https://doi.org/10.1007/978-3-642-80350-5_54
Automata, Languages and Programming
Christian Michaux and Roger VillemaireLecture Notes in Computer Science, Automata, Languages and Programming 700 325 (1993)
https://doi.org/10.1007/3-540-56939-1_83
On DOL systems with immigration
Juha HonkalaTheoretical Computer Science 120 (2) 229 (1993)
https://doi.org/10.1016/0304-3975(93)90289-6
Lindenmayer Systems
Juha HonkalaLindenmayer Systems 25 (1992)
https://doi.org/10.1007/978-3-642-58117-5_2
Ambiguous Numbers are Dense
Marko PetkovšekThe American Mathematical Monthly 97 (5) 408 (1990)
https://doi.org/10.1080/00029890.1990.11995616