Square-free words obtained from prefixes by permutations

Tietueen suppeat tiedot
dc.contributor.authorHarju T
dc.contributor.organizationfi=matematiikka|en=Mathematics|
dc.contributor.organization-code1.2.246.10.2458963.20.41687507875
dc.converis.publication-id1867478
dc.converis.urlhttps://research.utu.fi/converis/portal/Publication/1867478
dc.date.accessioned2022-10-28T14:41:10Z
dc.date.available2022-10-28T14:41:10Z
dc.description.abstractAn infinite square-free word w over a three letter alphabet T is said to have a k-stem sigma if w = sigma w(1)w(2) ... where for each i, there exists a permutation pi(i) of T which extended to a morphism gives w(i) = pi(i)(sigma). We show that there exists an infinite k-stem word for k = 1, 2, 3, 9 and 13 <= k <= 19, but not for 4 <= k <= 8 and 10 <= k <= 12. The problem whether k-stem words exist for each k >= 20 remains open. (C) 2011 Elsevier B.V. All rights reserved.
dc.format.pagerange128
dc.format.pagerange133
dc.identifier.jour-issn0304-3975
dc.identifier.olddbid189674
dc.identifier.oldhandle10024/172768
dc.identifier.urihttps://www.utupub.fi/handle/11111/44843
dc.identifier.urnURN:NBN:fi-fe2021042714327
dc.language.isoen
dc.okm.affiliatedauthorHarju, Tero
dc.okm.discipline111 Mathematicsen_GB
dc.okm.discipline111 Matematiikkafi_FI
dc.okm.internationalcopublicationnot an international co-publication
dc.okm.internationalityInternational publication
dc.okm.typeA1 ScientificArticle
dc.publisherELSEVIER SCIENCE BV
dc.publisher.countryNetherlandsen_GB
dc.publisher.countryAlankomaatfi_FI
dc.publisher.country-codeNL
dc.relation.doi10.1016/j.tcs.2011.12.031
dc.relation.ispartofjournalTheoretical Computer Science
dc.relation.volume429
dc.source.identifierhttps://www.utupub.fi/handle/10024/172768
dc.titleSquare-free words obtained from prefixes by permutations
dc.year.issued2012

Tiedostot

Näytetään 1 - 1 / 1
Name:
harju_stem.pdf
Size:
212.54 KB
Format:
Adobe Portable Document Format
Description:
Final draft
Lataa

Kokoelmat

Rinnakkaistallenteet