Decidability of the HD0L ultimate periodicity problem
RAIRO-Theor. Inf. Appl., 47 2 (2013) 201-214
Published online: 2013-04-25
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):
Alexey Yakovlevich Kanel-Belov
Nazar Khangeldiyevich Agakhanov, N N Andreev, Sultan Najmudinovich Askhabov, Nikolay Mikhailovich Dobrovolsky, Alexander Isakovich Domoshnitsky, Sergey Alexandrovich Dorichenko, Mikhail Vladimirovich Zaitsev, Ilya Anatolievich Ivanov-Pogodaev, Aleksey Anatolievich Kolchev, Sergei Grigorievich Malev, Ivan Viktorovich Mitrofanov, Aleksandr Aleksandrovich Mikhalev, Sergey Petrovich Mishchenko, Vladimir Grigorievich Navodnov, Yuri Valentinovich Nesterenko, A M Pesin, Fedor Vladimirovich Petrov, Sergei Valentinovich Pchelintsev, Andrey Mikhailovich Raigorodsky, Filipp Dmitrievich Rukhovich, Leonid Mikhailovich Samoilov, A L Semenov, Vladlen Anatolievich Timorin, O N Tulupov, Mikhail Igorevich Kharitonov, et al.Chebyshevskii Sbornik 24 (4) 380 (2024)
https://doi.org/10.22405/2226-8383-2023-24-4-380-400
Automatic Abelian Complexities of Parikh-Collinear Fixed Points
Michel Rigo, Manon Stipulanti and Markus A. WhitelandTheory of Computing Systems 68 (6) 1622 (2024)
https://doi.org/10.1007/s00224-024-10197-5
Morphic Sequences: Complexity and Decidability
Raphael HenryElectronic Proceedings in Theoretical Computer Science 403 113 (2024)
https://doi.org/10.4204/EPTCS.403.24
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
Bracket words: A generalisation of Sturmian words arising from generalised polynomials
Boris Adamczewski and Jakub KoniecznyTransactions of the American Mathematical Society 376 (7) 4979 (2023)
https://doi.org/10.1090/tran/8906
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
Reachability Problems
Valérie BerthéLecture Notes in Computer Science, Reachability Problems 12448 3 (2020)
https://doi.org/10.1007/978-3-030-61739-4_1
Periodic points in random substitution subshifts
Dan RustMonatshefte für Mathematik 193 (3) 683 (2020)
https://doi.org/10.1007/s00605-020-01458-9
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
Monadic Second-Order Logic with Arbitrary Monadic Predicates
Nathanaël Fijalkow and Charles PapermanACM Transactions on Computational Logic 18 (3) 1 (2017)
https://doi.org/10.1145/3091124
Decidability and universality of quasiminimal subshifts
Ville SaloJournal of Computer and System Sciences 89 288 (2017)
https://doi.org/10.1016/j.jcss.2017.05.017
Relations on words
Michel RigoIndagationes Mathematicae 28 (1) 183 (2017)
https://doi.org/10.1016/j.indag.2016.11.018
Pursuit of the Universal
Valérie Berthé, Thomas Fernique and Mathieu SablikLecture Notes in Computer Science, Pursuit of the Universal 9709 13 (2016)
https://doi.org/10.1007/978-3-319-40189-8_2
Asymptotic properties of free monoid morphisms
Émilie Charlier, Julien Leroy and Michel RigoLinear Algebra and its Applications 500 119 (2016)
https://doi.org/10.1016/j.laa.2016.02.030
On almost periodicity of morphic sequences
I. V. MitrofanovDoklady Mathematics 93 (2) 207 (2016)
https://doi.org/10.1134/S1064562416020253
https://doi.org/10.1002/9781119042853.biblio
Mathematical Foundations of Computer Science 2014
Nathanaël Fijalkow and Charles PapermanLecture Notes in Computer Science, Mathematical Foundations of Computer Science 2014 8634 279 (2014)
https://doi.org/10.1007/978-3-662-44522-8_24
https://doi.org/10.1002/9781119008200.biblio