On the Number of Partially Abelian Square-Free Words on a Three-Letter Alphabet

[1]  Yuji Kobayashi,et al.  Enumeration of irreducible binary words , 1988, Discret. Appl. Math..

[2]  Aldo de Luca,et al.  Square-Free Words on Partially Commutative Free Monoids , 1986, Inf. Process. Lett..

[3]  Robert Cori,et al.  Automates et Commutations Partielles , 1985, RAIRO Theor. Informatics Appl..

[4]  Antonio Restivo,et al.  On weakly square free words , 1983, Bull. EATCS.

[5]  Maxime Crochemore,et al.  Sharp Characterizations of Squarefree Morphisms , 1982, Theor. Comput. Sci..