Square-free words with square-free self-shuffles (Q405075): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: There exist binary circular \(5/2^+\) power free words of every length / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Uniformly growing k-th power-free homomorphisms / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Self-shuffling Words / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A Note on Square-Free Shuffles of Words / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4584890 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3659988 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Unshuffling a square is NP-hard / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On Recognizing Words That Are Squares for the Shuffle Product / rank | |||
Normal rank | |||
Latest revision as of 23:47, 8 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Square-free words with square-free self-shuffles |
scientific article |
Statements
Square-free words with square-free self-shuffles (English)
0 references
4 September 2014
0 references
Summary: We answer a question of \textit{T. Harju} [Lect. Notes Comput. Sci. 8079, 154--160 (2013; Zbl 1309.68163)]: For every \(n\geq 3\) there is a square-free ternary word of length \(n\) with a square-free self-shuffle.
0 references
combinatorics on words
0 references
square-free words
0 references
self shuffles
0 references
