A generator of morphisms for infinite words
RAIRO-Theor. Inf. Appl., 40 3 (2006) 427-441
Published online: 2006-10-18
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):
(2024)
https://doi.org/10.2139/ssrn.4821124
Avoiding square-free words on free groups
Golnaz Badkobeh, Tero Harju, Pascal Ochem and Matthieu RosenfeldTheoretical Computer Science 922 206 (2022)
https://doi.org/10.1016/j.tcs.2022.04.025
Transition Property for Cube-Free Words
Elena A. Petrova and Arseny M. ShurTheory of Computing Systems 65 (3) 479 (2021)
https://doi.org/10.1007/s00224-020-09979-4
A family of formulas with reversal of arbitrarily high avoidability index
Pascal OchemTheoretical Computer Science 896 168 (2021)
https://doi.org/10.1016/j.tcs.2021.10.013
Branching Densities of Cube-Free and Square-Free Words
Elena A. Petrova and Arseny M. ShurAlgorithms 14 (4) 126 (2021)
https://doi.org/10.3390/a14040126
Combinatorics on Words
Pascal OchemLecture Notes in Computer Science, Combinatorics on Words 12847 153 (2021)
https://doi.org/10.1007/978-3-030-85088-3_13
Repetition avoidance in products of factors
Pamela Fleischmann, Pascal Ochem and Kamellia ReshadiTheoretical Computer Science 791 123 (2019)
https://doi.org/10.1016/j.tcs.2019.04.013
11532 311 (2019)
https://doi.org/10.1007/978-3-030-19955-5_27
Subword complexity and power avoidance
Jeffrey Shallit and Arseny ShurTheoretical Computer Science 792 96 (2019)
https://doi.org/10.1016/j.tcs.2018.09.010
11682 264 (2019)
https://doi.org/10.1007/978-3-030-28796-2_21
Sequences, Groups, and Number Theory
Pascal Ochem, Michaël Rao and Matthieu RosenfeldTrends in Mathematics, Sequences, Groups, and Number Theory 177 (2018)
https://doi.org/10.1007/978-3-319-69152-7_5
Avoidability of circular formulas
Guilhem Gamard, Pascal Ochem, Gwenaël Richomme and Patrice SééboldTheoretical Computer Science 726 1 (2018)
https://doi.org/10.1016/j.tcs.2017.11.014
On the aperiodic avoidability of binary patterns with variables and reversals
Robert MercaşTheoretical Computer Science 682 180 (2017)
https://doi.org/10.1016/j.tcs.2016.12.022
Developments in Language Theory
Pascal Ochem and Matthieu RosenfeldLecture Notes in Computer Science, Developments in Language Theory 9840 344 (2016)
https://doi.org/10.1007/978-3-662-53132-7_28
Characterization of some binary words with few squares
Golnaz Badkobeh and Pascal OchemTheoretical Computer Science 588 73 (2015)
https://doi.org/10.1016/j.tcs.2015.03.044
Infinite binary words containing repetitions of odd period
Golnaz Badkobeh and Maxime CrochemoreInformation Processing Letters 115 (5) 543 (2015)
https://doi.org/10.1016/j.ipl.2015.01.004
Language and Automata Theory and Applications
Francine Blanchet-Sadri, Andrew Lohr, Sean Simmons and Brent WoodhouseLecture Notes in Computer Science, Language and Automata Theory and Applications 8370 173 (2014)
https://doi.org/10.1007/978-3-319-04921-2_14
Developments in Language Theory
Francine Blanchet-Sadri and Brent WoodhouseLecture Notes in Computer Science, Developments in Language Theory 7907 106 (2013)
https://doi.org/10.1007/978-3-642-38771-5_11
Infinite words containing the minimal number of repetitions
Golnaz BadkobehJournal of Discrete Algorithms 20 38 (2013)
https://doi.org/10.1016/j.jda.2013.03.001
Strict bounds for pattern avoidance
F. Blanchet-Sadri and Brent WoodhouseTheoretical Computer Science 506 17 (2013)
https://doi.org/10.1016/j.tcs.2013.08.010
Computing the partial word avoidability indices of ternary patterns
F. Blanchet-Sadri, Andrew Lohr and Shane ScottJournal of Discrete Algorithms 23 119 (2013)
https://doi.org/10.1016/j.jda.2013.06.009
Growth properties of power-free languages
Arseny M. ShurComputer Science Review 6 (5-6) 187 (2012)
https://doi.org/10.1016/j.cosrev.2012.09.001
Repetition thresholds for subdivided graphs and trees
Pascal Ochem and Elise VasletRAIRO - Theoretical Informatics and Applications 46 (1) 123 (2012)
https://doi.org/10.1051/ita/2011122
Mathematical Foundations of Computer Science 2012
Igor N. Tunev and Arseny M. ShurLecture Notes in Computer Science, Mathematical Foundations of Computer Science 2012 7464 800 (2012)
https://doi.org/10.1007/978-3-642-32589-2_69
Combinatorial Algorithms
Francine Blanchet-Sadri, Andrew Lohr and Shane ScottLecture Notes in Computer Science, Combinatorial Algorithms 7643 206 (2012)
https://doi.org/10.1007/978-3-642-35926-2_23
Fewest repetitions versus maximal-exponent powers in infinite binary words
Golnaz BadkobehTheoretical Computer Science 412 (48) 6625 (2011)
https://doi.org/10.1016/j.tcs.2011.08.011
Language and Automata Theory and Applications
Francine Blanchet-Sadri, Kevin Black and Andrew ZemkeLecture Notes in Computer Science, Language and Automata Theory and Applications 6638 155 (2011)
https://doi.org/10.1007/978-3-642-21254-3_11
Avoiding large squares in partial words
F. Blanchet-Sadri, Ilkyoo Choi and Robert MercaşTheoretical Computer Science 412 (29) 3752 (2011)
https://doi.org/10.1016/j.tcs.2011.04.009
Developments in Language Theory
Arseny M. ShurLecture Notes in Computer Science, Developments in Language Theory 6795 28 (2011)
https://doi.org/10.1007/978-3-642-22321-1_3
Finite-Repetition threshold for infinite ternary words
Golnaz Badkobeh and Maxime CrochemoreElectronic Proceedings in Theoretical Computer Science 63 37 (2011)
https://doi.org/10.4204/EPTCS.63.7
Binary words avoiding the pattern AABBCABBA
Pascal OchemRAIRO - Theoretical Informatics and Applications 44 (1) 151 (2010)
https://doi.org/10.1051/ita/2010010
Letter frequency in infinite repetition-free words
Pascal OchemTheoretical Computer Science 380 (3) 388 (2007)
https://doi.org/10.1016/j.tcs.2007.03.027