{"docId":8398,"paperId":5460,"url":"https:\/\/dmtcs.episciences.org\/5460","doi":"10.46298\/dmtcs.5460","journalName":"Discrete Mathematics & Theoretical Computer Science","issn":"","eissn":"1365-8050","volume":[{"vid":446,"name":"vol. 23, no. 3"}],"section":[{"sid":5,"title":"Automata, Logic and Semantics","description":[]}],"repositoryName":"arXiv","repositoryIdentifier":"1904.07137","repositoryVersion":4,"repositoryLink":"https:\/\/arxiv.org\/abs\/1904.07137v4","dateSubmitted":"2019-05-15 10:20:53","dateAccepted":"2021-08-02 22:03:41","datePublished":"2021-08-30 14:58:00","titles":["Binary patterns in the Prouhet-Thue-Morse sequence"],"authors":["Almeida, Jorge","Kl\u00edma, Ond\u0159ej"],"abstracts":["We show that, with the exception of the words $a^2ba^2$ and $b^2ab^2$, all (finite or infinite) binary patterns in the Prouhet-Thue-Morse sequence can actually be found in that sequence as segments (up to exchange of letters in the infinite case). This result was previously attributed to unpublished work by D. Guaiana and may also be derived from publications of A. Shur only available in Russian. We also identify the (finitely many) finite binary patterns that appear non trivially, in the sense that they are obtained by applying an endomorphism that does not map the set of all segments of the sequence into itself."],"keywords":["Mathematics - Combinatorics","Primary: 68R15, Secondary: 11B85, 20M05, 20M35, 37B10"]}