Overlap-freeness in infinite partial words
From MaRDI portal
Publication:1006076
DOI10.1016/j.tcs.2008.12.041zbMath1165.68058OpenAlexW2078173764MaRDI QIDQ1006076
Tomi Kärki, Vesa Halava, Patrice Séébold, Tero J.Harju
Publication date: 17 March 2009
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://hal-lirmm.ccsd.cnrs.fr/lirmm-00382675/file/TCS7276.pdf
overlapinfinite wordsThue-Morse wordpartial words\(k\)-freerepetition-freenessrestricted square property
Related Items (7)
Squareable Words ⋮ On universal partial words ⋮ Periodicity algorithms and a conjecture on overlaps in partial words ⋮ Avoiding Abelian squares in partial words ⋮ On the number of squares in partial words ⋮ An Answer to a Conjecture on Overlaps in Partial Words Using Periodicity Algorithms ⋮ Avoidable binary patterns in partial words
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- New estimates of odd exponents of infinite Burnside groups.
- Codes, orderings, and partial words
- Square-free partial words
- Partial words and a theorem of Fine and Wilf
- Relational codes of words
- Freeness of partial words
- Unending chess, symbolic dynamics and a problem in semi-groups
- Restorations of punctured languages and similarity of languages
- Automatic Sequences
- Partial words and the interaction property of periods
- ALGORITHMIC COMBINATORICS ON PARTIAL WORDS
- DNA Computing
This page was built for publication: Overlap-freeness in infinite partial words
