Infinite ternary square-free words concatenated from permutations of a single word (Q390906): Difference between revisions

@@ Property / cites work @@
+There exist binary circular \(5/2^+\) power free words of every length
+Normal rank
@@ Property / cites work @@
+Sharp characterizations of squarefree morphisms
@@ Property / cites work: Sharp characterizations of squarefree morphisms / rank @@
+Normal rank
@@ Property / cites work @@
+There are \(k\)-uniform cubefree binary morphisms for all \(k \geq 0\)
+Normal rank
@@ Property / cites work @@
+Square-free words obtained from prefixes by permutations
+Normal rank
@@ Property / cites work @@
+Square-free shuffles of words
@@ Property / cites work: Square-free shuffles of words / rank @@
+Normal rank
@@ Property / cites work @@
+Abelian squares are avoidable on 4 letters
@@ Property / cites work: Abelian squares are avoidable on 4 letters / rank @@
+Normal rank
@@ Property / cites work @@
+Q3659988
@@ Property / cites work: Q3659988 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5646912
@@ Property / cites work: Q5646912 / rank @@
+Normal rank