A1 Refereed original research article in a scientific journal
Square-free shuffles of words
Authors: Harju T, Muller M
Conference name: International Conference on WORDS
Publisher: ELSEVIER SCIENCE BV
Publication year: 2015
Journal: Theoretical Computer Science
Journal name in source: THEORETICAL COMPUTER SCIENCE
Journal acronym: THEOR COMPUT SCI
Volume: 601
First page : 29
Last page: 38
Number of pages: 10
ISSN: 0304-3975
DOI: https://doi.org/10.1016/j.tcs.2015.07.024
Abstract
Let u(sic)v denote the set of all shuffles of the words u and v. It is shown that for each integer n >= 3 there exists a square-free ternary word u of length n such that u(sic)u contains a square-free word. This property is then shown to also hold for infinite words, i.e., there exists an infinite square-free word u on three letters such that u can be shuffled with itself to produce an infinite square-free word w is an element of u(sic)u. (C) 2015 Elsevier B.V. All rights reserved.
Let u(sic)v denote the set of all shuffles of the words u and v. It is shown that for each integer n >= 3 there exists a square-free ternary word u of length n such that u(sic)u contains a square-free word. This property is then shown to also hold for infinite words, i.e., there exists an infinite square-free word u on three letters such that u can be shuffled with itself to produce an infinite square-free word w is an element of u(sic)u. (C) 2015 Elsevier B.V. All rights reserved.
UTU Research Portal