On the number of Abelian square-free words on four letters
Author:
- Arturo CarpiACArturo Carpi
- 1 January 1998
- journal article
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 81 (1-3) , 155-167
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- ON ABELIAN POWER-FREE MORPHISMSInternational Journal of Algebra and Computation, 1993
- Enumeration of irreducible binary wordsDiscrete Applied Mathematics, 1988
- Uniformly growing k-th power-free homomorphismsTheoretical Computer Science, 1988
- A linear-time algorithm to decide whether a binary word contains an overlapRAIRO - Theoretical Informatics and Applications, 1988
- Avoidable patterns in strings of symbolsPacific Journal of Mathematics, 1979
- Strongly non-repetitive sequences and progression-free setsJournal of Combinatorial Theory, Series A, 1979