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:
Jean-Jacques Pansiot
RAIRO-Theor. Inf. Appl., 20 1 (1986) 43-46
Published online: 2017-02-01
This article has been cited by the following article(s):
45 articles
Morphic Sequences: Complexity and Decidability
Raphael Henry Electronic Proceedings in Theoretical Computer Science 403 113 (2024) https://doi.org/10.4204/EPTCS.403.24
New string attractor-based complexities for infinite words
Julien Cassaigne, France Gheeraert, Antonio Restivo, Giuseppe Romana, Marinella Sciortino and Manon Stipulanti Journal of Combinatorial Theory, Series A 208 105936 (2024) https://doi.org/10.1016/j.jcta.2024.105936
Decidable problems in substitution shifts
Marie-Pierre Béal, Dominique Perrin and Antonio Restivo Journal of Computer and System Sciences 143 103529 (2024) https://doi.org/10.1016/j.jcss.2024.103529
Self-similarity and spectral theory: on the spectrum of substitutions
A. Bufetov and B. Solomyak St. Petersburg Mathematical Journal 34 (3) 313 (2023) https://doi.org/10.1090/spmj/1756
Developments in Language Theory
Andrea Frosini, Ilaria Mancini, Simone Rinaldi, Giuseppe Romana and Marinella Sciortino Lecture Notes in Computer Science, Developments in Language Theory 13257 139 (2022) https://doi.org/10.1007/978-3-031-05578-2_11
Aperiodic SFTs on Baumslag-Solitar groups
Solène J. Esnay and Etienne Moutot Theoretical Computer Science 917 31 (2022) https://doi.org/10.1016/j.tcs.2022.03.010
Profinite Semigroups and Symbolic Dynamics
Jorge Almeida, Alfredo Costa, Revekka Kyriakoglou and Dominique Perrin Lecture Notes in Mathematics, Profinite Semigroups and Symbolic Dynamics 2274 139 (2020) https://doi.org/10.1007/978-3-030-55215-2_5
Periodic points in random substitution subshifts
Dan Rust Monatshefte für Mathematik 193 (3) 683 (2020) https://doi.org/10.1007/s00605-020-01458-9
Singular substitutions of constant length
ARTEMI BERLINKOV and BORIS SOLOMYAK Ergodic Theory and Dynamical Systems 39 (9) 2384 (2019) https://doi.org/10.1017/etds.2017.133
Spectral theory of substitutions
ALAN BARTLETT Ergodic Theory and Dynamical Systems 38 (4) 1289 (2018) https://doi.org/10.1017/etds.2016.66
Relations on words
Michel Rigo Indagationes Mathematicae 28 (1) 183 (2017) https://doi.org/10.1016/j.indag.2016.11.018
Spectrum of a Rudin–Shapiro-like sequence
Lax Chan and Uwe Grimm Advances in Applied Mathematics 87 16 (2017) https://doi.org/10.1016/j.aam.2016.12.003
Coding of substitution dynamical systems as shifts of finite type
PAUL SURER Ergodic Theory and Dynamical Systems 36 (3) 944 (2016) https://doi.org/10.1017/etds.2014.80
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) https://doi.org/10.1016/j.jda.2015.03.006
Periodicity of Morphic Words
I. V. Mitrofanov Journal of Mathematical Sciences 206 (6) 679 (2015) https://doi.org/10.1007/s10958-015-2344-2
Iterative Algebras
Jason P. Bell and Blake W. Madill Algebras and Representation Theory 18 (6) 1533 (2015) https://doi.org/10.1007/s10468-015-9550-y
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
193 (2014) https://doi.org/10.1002/9781119042853.biblio
257 (2014) https://doi.org/10.1002/9781119008200.biblio
Presentations of Schützenberger groups of minimal subshifts
Jorge Almeida and Alfredo Costa Israel Journal of Mathematics 196 (1) 1 (2013) https://doi.org/10.1007/s11856-012-0139-4
DECIDABILITY OF UNIFORM RECURRENCE OF MORPHIC SEQUENCES
FABIEN DURAND International Journal of Foundations of Computer Science 24 (01) 123 (2013) https://doi.org/10.1142/S0129054113500032
The sequence equivalence problem for primitive D0L systems
Juha Honkala Journal of Computer and System Sciences 79 (1) 101 (2013) https://doi.org/10.1016/j.jcss.2012.05.013
Decidability of the HD0L ultimate periodicity problem
Fabien Durand RAIRO - Theoretical Informatics and Applications 47 (2) 201 (2013) https://doi.org/10.1051/ita/2013035
Language and Automata Theory and Applications
Narad Rampersad Lecture Notes in Computer Science, Language and Automata Theory and Applications 6638 65 (2011) https://doi.org/10.1007/978-3-642-21254-3_4
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) https://doi.org/10.4204/EPTCS.63.20
Developments in Language Theory
Vesa Halava, Tero Harju, Tomi Kärki and Michel Rigo Lecture 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 Honkala Theoretical 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 PRITYKIN International 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 RIGO International Journal of Algebra and Computation 19 (06) 809 (2009) https://doi.org/10.1142/S0218196709005330
Periodicity Problem of Substitutions over Ternary Alphabets
Bo Tan and Zhi-Ying Wen RAIRO - Theoretical Informatics and Applications 42 (4) 747 (2008) https://doi.org/10.1051/ita:2007057
Cancellation and periodicity properties of iterated morphisms
Juha Honkala Theoretical Computer Science 391 (1-2) 61 (2008) https://doi.org/10.1016/j.tcs.2007.10.030
A graph approach to computing nondeterminacy in substitutional dynamical systems
Toke M. Carlsen and Søren Eilers RAIRO - Theoretical Informatics and Applications 41 (3) 285 (2007) https://doi.org/10.1051/ita:2007020
The Lempel–Ziv Complexity of Fixed Points of Morphisms
Sorin Constantinescu and Lucian Ilie SIAM Journal on Discrete Mathematics 21 (2) 466 (2007) https://doi.org/10.1137/050646846
On the subword equivalence problem for morphic words
Isabelle Fagnot Discrete Applied Mathematics 75 (3) 231 (1997) https://doi.org/10.1016/S0166-218X(97)89162-7
Handbook of Formal Languages
Christian Choffrut and Juhani Karhumäki Handbook of Formal Languages 329 (1997) https://doi.org/10.1007/978-3-642-59136-5_6
On DOL systems with immigration
Juha Honkala Theoretical Computer Science 120 (2) 229 (1993) https://doi.org/10.1016/0304-3975(93)90289-6
STACS 92
Karel Culik and Juhani Karhumäki Lecture 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 Lando Theoretical Computer Science 82 (1) 19 (1991) https://doi.org/10.1016/0304-3975(91)90169-3
Sequences
Tom Head and Barbara Lando Sequences 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 Head Theoretical Computer Science 73 (3) 329 (1990) https://doi.org/10.1016/0304-3975(90)90183-I
STACS 89
J. Berstel Lecture Notes in Computer Science, STACS 89 349 36 (1989) https://doi.org/10.1007/BFb0028971
Bounded DOL languages
Tom Head and Barbara Lando Theoretical Computer Science 51 (3) 255 (1987) https://doi.org/10.1016/0304-3975(87)90035-1
Prefixes of infinite words and ambiguous context-free languages
Jean-Michel Autebert, Philippe Flajolet and Joaquim Gabarro Information Processing Letters 25 (4) 211 (1987) https://doi.org/10.1016/0020-0190(87)90162-1
Periodic D0L languages
Tom Head and Barbara Lando Theoretical Computer Science 46 83 (1986) https://doi.org/10.1016/0304-3975(86)90023-X
Regularity of sets of initial strings of periodic D0L-systems
Tom Head and Barbara Lando Theoretical Computer Science 48 101 (1986) https://doi.org/10.1016/0304-3975(86)90086-1