Square-free words obtained from prefixes by permutations

DOI10.1016/J.TCS.2011.12.031zbMATH Open1243.68232OpenAlexW2040472207MaRDI QIDQ418771FDOQ418771

Authors: Tero 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

Recommendations

• More on Square-free Words Obtained from Prefixes by Permutations
• Infinite ternary square-free words concatenated from permutations of a single word
• scientific article; zbMATH DE number 3894492
• Extremal square-free words
• On square-free arithmetic progressions in infinite words

zbMATH Keywords

Thue-Morse wordsquare-free wordsmorphismsstem

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Uniformly growing k-th power-free homomorphisms
• Sharp characterizations of squarefree morphisms
• Title not available (Why is that?)
• 2726. A problem on strings of beads
• On the size of a square-free morphism on a three letter alphabet
• Growth of repetition-free words -- a review
• Improved bounds on the number of ternary square-free words
• NON-REPETITIVE SEQUENCES ON THREE SYMBOLS
• Title not available (Why is that?)

Cited In (5)

• Infinite ternary square-free words concatenated from permutations of a single word
• Square-free words with one possible mismatch
• More on Square-free Words Obtained from Prefixes by Permutations
• Square-free shuffles of words
• Generating square-free words efficiently

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q418771)