论文信息 - Partially Abelian squarefree words

Partially Abelian squarefree words

On generalise la notion de mots sans carre et de mots sans carre abelien en introduisant celle de mot sans carre partiellement abelien pour une relation de commutation θ. Des resultats concernant le caractere fini ou infini de l'ensemble des mots sans carre partiellement abelien sont obtenus dans le cas des alphabets de trois ou quatre lettres

Robert Cori | Maria Rosaria Formisano

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

[2] Jean Berstel,et al. Some Recent Results on Squarefree Words , 1984, STACS.

[3] Grzegorz Rozenberg,et al. Theory of Traces , 1988, Theor. Comput. Sci..

[4] Dwight R. Bean,et al. Avoidable patterns in strings of symbols , 1979 .

[5] Pierre Cartier,et al. Problemes combinatoires de commutation et rearrangements , 1969 .

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

[7] P. Pleasants. Non-repetitive sequences , 1970, Mathematical Proceedings of the Cambridge Philosophical Society.

[8] Robert Shelton. Aperiodic words on three symbols. , 1981 .

[9] M. Crochemore. Mots Et Morphismes Sans Carré , 1983 .

[10] A. Mazurkiewicz. Concurrent Program Schemes and their Interpretations , 1977 .

[11] Arturo Carpi. On the Size of a Square-Free Morphism on a Three Letter Alphabet , 1983, Inf. Process. Lett..