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):

Vesa Halava, Tero Harju, Tomi Kärki and Michel Rigo
6224 209 (2010)
DOI: 10.1007/978-3-642-14455-4_20
See this article

Christian Choffrut
49 (1992)
DOI: 10.1007/978-3-642-58117-5_3
See this article

Block maps between primitive uniform and Pisot substitutions

VILLE SALO and ILKKA TÖRMÄ
Ergodic Theory and Dynamical Systems 35 (7) 2292 (2015)
DOI: 10.1017/etds.2014.29
See this article

Tom Head and Barbara Lando
244 (1990)
DOI: 10.1007/978-1-4612-3352-7_18
See this article

Periodicity and ultimate periodicity of D0L systems

Barbara Lando
Theoretical Computer Science 82 (1) 19 (1991)
DOI: 10.1016/0304-3975(91)90169-3
See this article

Periodic D0L languages

Tom Head and Barbara Lando
Theoretical Computer Science 46 83 (1986)
DOI: 10.1016/0304-3975(86)90023-X
See this article

Cancellation and periodicity properties of iterated morphisms

Juha Honkala
Theoretical Computer Science 391 (1-2) 61 (2008)
DOI: 10.1016/j.tcs.2007.10.030
See this article

On the subword equivalence problem for morphic words

Isabelle Fagnot
Discrete Applied Mathematics 75 (3) 231 (1997)
DOI: 10.1016/S0166-218X(97)89162-7
See this article

Presentations of Schützenberger groups of minimal subshifts

Jorge Almeida and Alfredo Costa
Israel Journal of Mathematics 196 (1) 1 (2013)
DOI: 10.1007/s11856-012-0139-4
See this article

Sur les facteurs des mots automatiques

Isabelle Fagnot
Theoretical Computer Science 172 (1-2) 67 (1997)
DOI: 10.1016/S0304-3975(96)00239-3
See this article

DECIDABILITY OF UNIFORM RECURRENCE OF MORPHIC SEQUENCES

FABIEN DURAND
International Journal of Foundations of Computer Science 24 (01) 123 (2013)
DOI: 10.1142/S0129054113500032
See this article

The set of strings mapped into a submonoid by iterates of a morphism

Tom Head
Theoretical Computer Science 73 (3) 329 (1990)
DOI: 10.1016/0304-3975(90)90183-I
See this article

Iterative Algebras

Jason P. Bell and Blake W. Madill
Algebras and Representation Theory 18 (6) 1533 (2015)
DOI: 10.1007/s10468-015-9550-y
See this article

On DOL systems with immigration

Juha Honkala
Theoretical Computer Science 120 (2) 229 (1993)
DOI: 10.1016/0304-3975(93)90289-6
See this article

Coding of substitution dynamical systems as shifts of finite type

PAUL SURER
Ergodic Theory and Dynamical Systems 36 (03) 944 (2016)
DOI: 10.1017/etds.2014.80
See this article

On D0L power series

Juha Honkala
Theoretical Computer Science 244 (1-2) 117 (2000)
DOI: 10.1016/S0304-3975(98)00338-7
See this article

Prefixes of infinite words and ambiguous context-free languages

Jean-Michel Autebert, Philippe Flajolet and Joaquim Gabarro
Information Processing Letters 25 (4) 211 (1987)
DOI: 10.1016/0020-0190(87)90162-1
See this article

An algorithm for enumerating all infinite repetitions in a D0L-system

Karel Klouda and Štěpán Starosta
Journal of Discrete Algorithms 33 130 (2015)
DOI: 10.1016/j.jda.2015.03.006
See this article

Relations on words

Michel Rigo
Indagationes Mathematicae 28 (1) 183 (2017)
DOI: 10.1016/j.indag.2016.11.018
See this article

A DECISION PROBLEM FOR ULTIMATELY PERIODIC SETS IN NONSTANDARD NUMERATION SYSTEMS

JASON BELL, EMILIE CHARLIER, AVIEZRI S. FRAENKEL and MICHEL RIGO
International Journal of Algebra and Computation 19 (06) 809 (2009)
DOI: 10.1142/S0218196709005330
See this article

Regularity of sets of initial strings of periodic D0L-systems

Tom Head and Barbara Lando
Theoretical Computer Science 48 101 (1986)
DOI: 10.1016/0304-3975(86)90086-1
See this article

On the simplification of infinite morphic words

Juha Honkala
Theoretical Computer Science 410 (8-10) 997 (2009)
DOI: 10.1016/j.tcs.2008.12.037
See this article

Bounded DOL languages

Tom Head and Barbara Lando
Theoretical Computer Science 51 (3) 255 (1987)
DOI: 10.1016/0304-3975(87)90035-1
See this article

Asymptotic behaviour of bi-infinite words

Wit Foryś
RAIRO - Theoretical Informatics and Applications 38 (1) 27 (2004)
DOI: 10.1051/ita:2004002
See this article

A new proof for the decidability of D0L ultimate periodicity

Vesa Halava, Tero Harju and Tomi Kärki
Electronic Proceedings in Theoretical Computer Science 63 147 (2011)
DOI: 10.4204/EPTCS.63.20
See this article

Filippo Mignosi and Patrice Séébold
700 507 (1993)
DOI: 10.1007/3-540-56939-1_98
See this article

Yuji Kobayash and Friedrich Otto
1295 337 (1997)
DOI: 10.1007/BFb0029977
See this article

Sets of primitive words given by fixed points of mappings

Janusz Matyja
International Journal of Computer Mathematics 76 (4) 435 (2001)
DOI: 10.1080/00207160108805037
See this article

ON UNIFORMLY RECURRENT MORPHIC SEQUENCES

FRANCOIS NICOLAS and YURI PRITYKIN
International Journal of Foundations of Computer Science 20 (05) 919 (2009)
DOI: 10.1142/S0129054109006966
See this article

Christian Choffrut and Juhani Karhumäki
329 (1997)
DOI: 10.1007/978-3-642-59136-5_6
See this article

Jorge Almeida, Alfredo Costa, Revekka Kyriakoglou and Dominique Perrin
2274 139 (2020)
DOI: 10.1007/978-3-030-55215-2_5
See this article

Karel Culik and Juhani Karhumäki
577 529 (1992)
DOI: 10.1007/3-540-55210-3_210
See this article

Narad Rampersad
6638 65 (2011)
DOI: 10.1007/978-3-642-21254-3_4
See this article

Decidability of the HD0L ultimate periodicity problem

Fabien Durand
RAIRO - Theoretical Informatics and Applications 47 (2) 201 (2013)
DOI: 10.1051/ita/2013035
See this article

Periodicity Problem of Substitutions over Ternary Alphabets

Bo Tan and Zhi-Ying Wen
RAIRO - Theoretical Informatics and Applications 42 (4) 747 (2008)
DOI: 10.1051/ita:2007057
See this article