Square-free words obtained from prefixes by permutations

DOI10.1016/J.TCS.2011.12.031zbMath1243.68232OpenAlexW2040472207MaRDI QIDQ418771

Tero J.Harju

Publication date: 30 May 2012

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

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

zbMATH Keywords

morphismsThue-Morse wordsquare-free wordsstem

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Related Items (2)

Infinite ternary square-free words concatenated from permutations of a single word ⋮ Square-free shuffles of words

Cites Work

• Sharp characterizations of squarefree morphisms
• Uniformly growing k-th power-free homomorphisms
• On the size of a square-free morphism on a three letter alphabet
• Growth of repetition-free words -- a review
• 2726. A problem on strings of beads
• NON-REPETITIVE SEQUENCES ON THREE SYMBOLS
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Square-free words obtained from prefixes by permutations