Square-free words on partially commutative free monoids☆
References (12)
Sharp characterization of square-free morphisms
Theoret. Comput. Sci.
(1982)Sur les mots sans carré définis par un morphisme
- et al.
An application of the theory of free partially commutative monoids: Asymptotic densities of trace languages
- et al.
Problèmes Combinatoires de Commutation et Réarrangements
- et al.
Rational subsets of some partially abelian monoids
- R. Cori and D. Perrin, Sur la reconnaissabilité dans les monoides partiellement commutatifs libres, RAIRO I.T., to...
There are more references available in the full text version of this article.
Cited by (9)
Growth of repetition-free words - A review
2005, Theoretical Computer ScienceOn the number of partially abelian square-free words on a three-letter alphabet
1991, Theoretical Computer ScienceNon-repetitive words relative to a rewriting system
1990, Theoretical Computer ScienceTheory of traces
1988, Theoretical Computer ScienceSquare-free words over partially commutative alphabets
2015, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)Strongly k-abelian repetitions
2013, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
- ☆
This research was partially supported by the Italian Ministry of Education.
Copyright © 1986 Published by Elsevier B.V.