Show simple item record

dc.contributor.authorBrown, Shandy
dc.contributor.authorRampersad, Narad
dc.contributor.authorShallit, Jeffrey
dc.contributor.authorVasiga, Troy
dc.date.accessioned2020-09-17T03:32:04Z
dc.date.available2020-09-17T03:32:04Z
dc.date.issued2006
dc.identifier.citationShandy Brown, Narad Rampersad, Jeffrey Shallit, and Troy Vasiga, "Squares and overlaps in the Thue-Morse sequence and some variants." RAIRO - Theoretical Informatics and Applications / Informatique Théorique et Applications 40 (2006): 473-484. DOI: 10.1051/ita:2006030.en_US
dc.identifier.issn0988-3754
dc.identifier.urihttp://hdl.handle.net/10680/1833
dc.description.abstractWe consider the position and number of occurrences of squares in the Thue-Morse sequence, and show that the corresponding sequences are 2-regular. We also prove that changing any finite but nonzero number of bits in the Thue-Morse sequence creates an overlap, and any linear subsequence of the Thue-Morse sequence (except those corresponding to decimation by a power of 2) contains an overlap.en_US
dc.description.urihttp://www.numdam.org/item/ITA_2006__40_3_473_0/en_US
dc.language.isoenen_US
dc.publisherEDP Sciencesen_US
dc.rightsinfo:eu-repo/semantics/openAccessen_US
dc.subjectThue-Morse worden_US
dc.subjectOverlap-free worden_US
dc.subjectAutomatic sequenceen_US
dc.titleSquares and overlaps in the Thue-Morse sequence and some variantsen_US
dc.typeArticleen_US
dc.identifier.doihttps://doi.org/10.1051/ita:2006030en_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record