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:

Decidability of the HD0L ultimate periodicity problem

Fabien Durand

RAIRO-Theor. Inf. Appl., 47 2 (2013) 201-214

Published online: 2013-04-25

DOI: https://doi.org/10.1051/ita/2013035

This article has been cited by the following article(s):

Asymptotic properties of free monoid morphisms

Émilie Charlier, Julien Leroy and Michel Rigo
Linear Algebra and its Applications 500 119 (2016)
DOI: 10.1016/j.laa.2016.02.030
See this article

Decidability and universality of quasiminimal subshifts

Ville Salo
Journal of Computer and System Sciences 89 288 (2017)
DOI: 10.1016/j.jcss.2017.05.017
See this article

Mathematical Foundations of Computer Science 2014

Nathanaël Fijalkow and Charles Paperman
Lecture Notes in Computer Science, Mathematical Foundations of Computer Science 2014 8634 279 (2014)
DOI: 10.1007/978-3-662-44522-8_24
See this article

Periodic points in random substitution subshifts

Dan Rust
Monatshefte für Mathematik 193 (3) 683 (2020)
DOI: 10.1007/s00605-020-01458-9
See this article

Formal Languages, Automata and Numeration Systems 1

Formal Languages, Automata and Numeration Systems 1 257 (2014)
DOI: 10.1002/9781119008200.biblio
See this article

Pursuit of the Universal

Valérie Berthé, Thomas Fernique and Mathieu Sablik
Lecture Notes in Computer Science, Pursuit of the Universal 9709 13 (2016)
DOI: 10.1007/978-3-319-40189-8_2
See this article

On almost periodicity of morphic sequences

I. V. Mitrofanov
Doklady Mathematics 93 (2) 207 (2016)
DOI: 10.1134/S1064562416020253
See this article

Formal Languages, Automata and Numeration Systems 2

Formal Languages, Automata and Numeration Systems 2 193 (2014)
DOI: 10.1002/9781119042853.biblio
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

Reachability Problems

Valérie Berthé
Lecture Notes in Computer Science, Reachability Problems 12448 3 (2020)
DOI: 10.1007/978-3-030-61739-4_1
See this article

State Complexity of the Multiples of the Thue-Morse Set

Émilie Charlier, Célia Cisternino and Adeline Massuir
Electronic Proceedings in Theoretical Computer Science 305 34 (2019)
DOI: 10.4204/EPTCS.305.3
See this article

Monadic Second-Order Logic with Arbitrary Monadic Predicates

Nathanaël Fijalkow and Charles Paperman
ACM Transactions on Computational Logic 18 (3) 1 (2017)
DOI: 10.1145/3091124
See this article