Squares and overlaps in the Thue-Morse sequence and some variants
RAIRO-Theor. Inf. Appl., 40 3 (2006) 473-484
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):
GAPS IN THE THUE–MORSE WORD
LUKAS SPIEGELHOFERJournal of the Australian Mathematical Society 114 (1) 110 (2023)
https://doi.org/10.1017/S1446788721000380
The first-order theory of binary overlap-free words is decidable
Luke Schaeffer and Jeffrey ShallitCanadian Journal of Mathematics 1 (2023)
https://doi.org/10.4153/S0008414X23000342
Optimal Bounds for the Similarity Density of the Thue-Morse Word with Overlap-Free and 73-Power-Free Infinite Binary Words
Chen Fei Du, Jeffrey Shallit and Arseny M. ShurInternational Journal of Foundations of Computer Science 26 (08) 1147 (2015)
https://doi.org/10.1142/S012905411540016X
Similarity density of the Thue-Morse word with overlap-free infinite binary words
Chen Fei Du and Jeffrey ShallitElectronic Proceedings in Theoretical Computer Science 151 231 (2014)
https://doi.org/10.4204/EPTCS.151.16
Computer Science – Theory and Applications
Jeffrey ShallitLecture Notes in Computer Science, Computer Science – Theory and Applications 7913 49 (2013)
https://doi.org/10.1007/978-3-642-38536-0_5
ENUMERATION AND DECIDABLE PROPERTIES OF AUTOMATIC SEQUENCES
ÉMILIE CHARLIER, NARAD RAMPERSAD and JEFFREY SHALLITInternational Journal of Foundations of Computer Science 23 (05) 1035 (2012)
https://doi.org/10.1142/S0129054112400448
Developments in Language Theory
Émilie Charlier, Narad Rampersad and Jeffrey ShallitLecture Notes in Computer Science, Developments in Language Theory 6795 165 (2011)
https://doi.org/10.1007/978-3-642-22321-1_15
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
On the subword complexity of Thue–Morse polynomial extractions
Yossi MosheTheoretical Computer Science 389 (1-2) 318 (2007)
https://doi.org/10.1016/j.tcs.2007.10.015