Square-free words obtained from prefixes by permutations
Author:
- 20 April 2012
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 429, 128-133
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- Growth of repetition-free words—a reviewTheoretical Computer Science, 2005
- Uniformly growing k-th power-free homomorphismsTheoretical Computer Science, 1988
- On the size of a square-free morphism on a three letter alphabetInformation Processing Letters, 1983
- NON-REPETITIVE SEQUENCES ON THREE SYMBOLSThe Quarterly Journal of Mathematics, 1983
- Sharp characterizations of squarefree morphismsTheoretical Computer Science, 1982
- 2726. A problem on strings of beadsThe Mathematical Gazette, 1957