On the periodicity of morphisms on free monoids
RAIRO-Theor. Inf. Appl., 20 1 (1986) 47-54
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):
Decidable problems in substitution shifts
Marie-Pierre Béal, Dominique Perrin and Antonio RestivoJournal of Computer and System Sciences 143 103529 (2024)
https://doi.org/10.1016/j.jcss.2024.103529
Morphic Sequences: Complexity and Decidability
Raphael HenryElectronic Proceedings in Theoretical Computer Science 403 113 (2024)
https://doi.org/10.4204/EPTCS.403.24
Profinite Semigroups and Symbolic Dynamics
Jorge Almeida, Alfredo Costa, Revekka Kyriakoglou and Dominique PerrinLecture Notes in Mathematics, Profinite Semigroups and Symbolic Dynamics 2274 139 (2020)
https://doi.org/10.1007/978-3-030-55215-2_5
Relations on words
Michel RigoIndagationes Mathematicae 28 (1) 183 (2017)
https://doi.org/10.1016/j.indag.2016.11.018
Coding of substitution dynamical systems as shifts of finite type
PAUL SURERErgodic Theory and Dynamical Systems 36 (3) 944 (2016)
https://doi.org/10.1017/etds.2014.80
Iterative Algebras
Jason P. Bell and Blake W. MadillAlgebras and Representation Theory 18 (6) 1533 (2015)
https://doi.org/10.1007/s10468-015-9550-y
An algorithm for enumerating all infinite repetitions in a D0L-system
Karel Klouda and Štěpán StarostaJournal of Discrete Algorithms 33 130 (2015)
https://doi.org/10.1016/j.jda.2015.03.006
Block maps between primitive uniform and Pisot substitutions
VILLE SALO and ILKKA TÖRMÄErgodic Theory and Dynamical Systems 35 (7) 2292 (2015)
https://doi.org/10.1017/etds.2014.29
https://doi.org/10.1002/9781119008200.biblio
https://doi.org/10.1002/9781119042853.biblio
Presentations of Schützenberger groups of minimal subshifts
Jorge Almeida and Alfredo CostaIsrael Journal of Mathematics 196 (1) 1 (2013)
https://doi.org/10.1007/s11856-012-0139-4
Decidability of the HD0L ultimate periodicity problem
Fabien DurandRAIRO - Theoretical Informatics and Applications 47 (2) 201 (2013)
https://doi.org/10.1051/ita/2013035
DECIDABILITY OF UNIFORM RECURRENCE OF MORPHIC SEQUENCES
FABIEN DURANDInternational Journal of Foundations of Computer Science 24 (01) 123 (2013)
https://doi.org/10.1142/S0129054113500032
A new proof for the decidability of D0L ultimate periodicity
Vesa Halava, Tero Harju and Tomi KärkiElectronic Proceedings in Theoretical Computer Science 63 147 (2011)
https://doi.org/10.4204/EPTCS.63.20
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
On the simplification of infinite morphic words
Juha HonkalaTheoretical Computer Science 410 (8-10) 997 (2009)
https://doi.org/10.1016/j.tcs.2008.12.037
ON UNIFORMLY RECURRENT MORPHIC SEQUENCES
FRANCOIS NICOLAS and YURI PRITYKINInternational Journal of Foundations of Computer Science 20 (05) 919 (2009)
https://doi.org/10.1142/S0129054109006966
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
Cancellation and periodicity properties of iterated morphisms
Juha HonkalaTheoretical Computer Science 391 (1-2) 61 (2008)
https://doi.org/10.1016/j.tcs.2007.10.030
Periodicity Problem of Substitutions over Ternary Alphabets
Bo Tan and Zhi-Ying WenRAIRO - Theoretical Informatics and Applications 42 (4) 747 (2008)
https://doi.org/10.1051/ita:2007057
Asymptotic behaviour of bi-infinite words
Wit ForyśRAIRO - Theoretical Informatics and Applications 38 (1) 27 (2004)
https://doi.org/10.1051/ita:2004002
Sets of primitive words given by fixed points of mappings
Janusz MatyjaInternational Journal of Computer Mathematics 76 (4) 435 (2001)
https://doi.org/10.1080/00207160108805037
On D0L power series
Juha HonkalaTheoretical Computer Science 244 (1-2) 117 (2000)
https://doi.org/10.1016/S0304-3975(98)00338-7
Sur les facteurs des mots automatiques
Isabelle FagnotTheoretical Computer Science 172 (1-2) 67 (1997)
https://doi.org/10.1016/S0304-3975(96)00239-3
Handbook of Formal Languages
Christian Choffrut and Juhani KarhumäkiHandbook of Formal Languages 329 (1997)
https://doi.org/10.1007/978-3-642-59136-5_6
Mathematical Foundations of Computer Science 1997
Yuji Kobayash and Friedrich OttoLecture Notes in Computer Science, Mathematical Foundations of Computer Science 1997 1295 337 (1997)
https://doi.org/10.1007/BFb0029977
On the subword equivalence problem for morphic words
Isabelle FagnotDiscrete Applied Mathematics 75 (3) 231 (1997)
https://doi.org/10.1016/S0166-218X(97)89162-7
STACS 95
Isabelle FagnotLecture Notes in Computer Science, STACS 95 900 107 (1995)
https://doi.org/10.1007/3-540-59042-0_66
STACS 93
Philippe NarbelLecture Notes in Computer Science, STACS 93 665 226 (1993)
https://doi.org/10.1007/3-540-56503-5_25
Automata, Languages and Programming
Filippo Mignosi and Patrice SééboldLecture Notes in Computer Science, Automata, Languages and Programming 700 507 (1993)
https://doi.org/10.1007/3-540-56939-1_98
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
Christian ChoffrutLindenmayer Systems 49 (1992)
https://doi.org/10.1007/978-3-642-58117-5_3
STACS 92
Karel Culik and Juhani KarhumäkiLecture Notes in Computer Science, STACS 92 577 529 (1992)
https://doi.org/10.1007/3-540-55210-3_210
Periodicity and ultimate periodicity of D0L systems
Barbara LandoTheoretical Computer Science 82 (1) 19 (1991)
https://doi.org/10.1016/0304-3975(91)90169-3
Sequences
Tom Head and Barbara LandoSequences 244 (1990)
https://doi.org/10.1007/978-1-4612-3352-7_18
The set of strings mapped into a submonoid by iterates of a morphism
Tom HeadTheoretical Computer Science 73 (3) 329 (1990)
https://doi.org/10.1016/0304-3975(90)90183-I
Automata, Languages and Programming
Christian ChoffrutLecture Notes in Computer Science, Automata, Languages and Programming 443 490 (1990)
https://doi.org/10.1007/BFb0032053
STACS 89
J. BerstelLecture Notes in Computer Science, STACS 89 349 36 (1989)
https://doi.org/10.1007/BFb0028971
Prefixes of infinite words and ambiguous context-free languages
Jean-Michel Autebert, Philippe Flajolet and Joaquim GabarroInformation Processing Letters 25 (4) 211 (1987)
https://doi.org/10.1016/0020-0190(87)90162-1
Bounded DOL languages
Tom Head and Barbara LandoTheoretical Computer Science 51 (3) 255 (1987)
https://doi.org/10.1016/0304-3975(87)90035-1
Regularity of sets of initial strings of periodic D0L-systems
Tom Head and Barbara LandoTheoretical Computer Science 48 101 (1986)
https://doi.org/10.1016/0304-3975(86)90086-1
Periodic D0L languages
Tom Head and Barbara LandoTheoretical Computer Science 46 83 (1986)
https://doi.org/10.1016/0304-3975(86)90023-X