A linear-time algorithm to decide whether a binary word contains an overlap
RAIRO-Theor. Inf. Appl., 22 2 (1988) 135-145
Published online: 2017-02-01
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):
Deciding context equivalence of binary overlap-free words in linear time
Arseny M. ShurSemigroup Forum 84 (3) 447 (2012)
https://doi.org/10.1007/s00233-012-9382-6
Infinite words containing squares at every position
James Currie and Narad RampersadRAIRO - Theoretical Informatics and Applications 44 (1) 113 (2010)
https://doi.org/10.1051/ita/2010007
Overlap-free words and spectra of matrices
Raphaël M. Jungers, Vladimir Y. Protasov and Vincent D. BlondelTheoretical Computer Science 410 (38-40) 3670 (2009)
https://doi.org/10.1016/j.tcs.2009.04.022
LATIN 2008: Theoretical Informatics
Raphaël M. Jungers, Vladimir Yu. Protasov and Vincent D. BlondelLecture Notes in Computer Science, LATIN 2008: Theoretical Informatics 4957 84 (2008)
https://doi.org/10.1007/978-3-540-78773-0_8
On the context-freeness of the set of words containing overlaps
Narad RampersadInformation Processing Letters 102 (2-3) 74 (2007)
https://doi.org/10.1016/j.ipl.2006.11.008
Growth of repetition-free words—a review
Jean BerstelTheoretical Computer Science 340 (2) 280 (2005)
https://doi.org/10.1016/j.tcs.2005.03.039
Pattern avoidance: themes and variations
James D. CurrieTheoretical Computer Science 339 (1) 7 (2005)
https://doi.org/10.1016/j.tcs.2005.01.004
Unsolved Problems in Number Theory
Richard K. GuyProblem Books in Mathematics, Unsolved Problems in Number Theory 1 311 (2004)
https://doi.org/10.1007/978-0-387-26677-0_6
Polynomial versus exponential growth in repetition-free binary words
Juhani Karhumäki and Jeffrey ShallitJournal of Combinatorial Theory, Series A 105 (2) 335 (2004)
https://doi.org/10.1016/j.jcta.2003.12.004
On repetition-free binary words of minimal density
Roman Kolpakov, Gregory Kucherov and Yuri TarannikovTheoretical Computer Science 218 (1) 161 (1999)
https://doi.org/10.1016/S0304-3975(98)00257-6
On the number of Abelian square-free words on four letters
Arturo CarpiDiscrete Applied Mathematics 81 (1-3) 155 (1998)
https://doi.org/10.1016/S0166-218X(97)88002-X
Mathematical Foundations of Computer Science 1997
Roman Kolpakov and Gregory KucherovLecture Notes in Computer Science, Mathematical Foundations of Computer Science 1997 1295 347 (1997)
https://doi.org/10.1007/BFb0029978
Results and Trends in Theoretical Computer Science
J. BerstelLecture Notes in Computer Science, Results and Trends in Theoretical Computer Science 812 19 (1994)
https://doi.org/10.1007/3-540-58131-6_34
Overlap-free words and finite automata
Arturo CarpiTheoretical Computer Science 115 (2) 243 (1993)
https://doi.org/10.1016/0304-3975(93)90118-D
STACS 93
Julien CassaigneLecture Notes in Computer Science, STACS 93 665 216 (1993)
https://doi.org/10.1007/3-540-56503-5_24
Automata, Languages and Programming
Filippo Mignosi and Patrice SééboldLecture Notes in Computer Science, Automata, Languages and Programming 700 507 (1993)
https://doi.org/10.1007/3-540-56939-1_98