Generating square-free words efficiently

DOI10.1016/j.tcs.2015.07.027zbMath1330.68361DBLPjournals/tcs/Shur15OpenAlexW2192358462WikidataQ64357142 ScholiaQ64357142MaRDI QIDQ496050

Arseny M. Shur

Publication date: 16 September 2015

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2015.07.027

zbMATH Keywords

string algorithmsrandom wordsquare-free word

Mathematics Subject Classification ID

Algorithms on strings (68W32)

Related Items (3)

The undirected repetition threshold and undirected pattern avoidance ⋮ Approaching repetition thresholds via local resampling and entropy compression ⋮ On shuffled-square-free words

Cites Work

• Application of entropy compression in pattern avoidance
• Growth properties of power-free languages
• Nonrepetitive sequences on arithmetic progressions
• Avoiding approximate repetitions with respect to the longest common subsequence distance
• Growth of Power-Free Languages over Large Alphabets
• A constructive proof of the general lovász local lemma
• Two-Sided Bounds for the Growth Rates of Power-Free Languages

This page was built for publication: Generating square-free words efficiently