Partially abelian squarefree words

Robert Cori; Maria Rosaria Formisano

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications (1990)

  • Volume: 24, Issue: 6, page 509-520
  • ISSN: 0988-3754

How to cite

top

Cori, Robert, and Formisano, Maria Rosaria. "Partially abelian squarefree words." RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications 24.6 (1990): 509-520. <http://eudml.org/doc/92372>.

@article{Cori1990,
author = {Cori, Robert, Formisano, Maria Rosaria},
journal = {RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications},
keywords = {free semigroups; squarefree words; partial commutativity},
language = {eng},
number = {6},
pages = {509-520},
publisher = {EDP-Sciences},
title = {Partially abelian squarefree words},
url = {http://eudml.org/doc/92372},
volume = {24},
year = {1990},
}

TY - JOUR
AU - Cori, Robert
AU - Formisano, Maria Rosaria
TI - Partially abelian squarefree words
JO - RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
PY - 1990
PB - EDP-Sciences
VL - 24
IS - 6
SP - 509
EP - 520
LA - eng
KW - free semigroups; squarefree words; partial commutativity
UR - http://eudml.org/doc/92372
ER -

References

top
  1. 1. I. J. AALBERSBERG and G. ROZENBERG, Theory of Traces, Theor. Comp. Sci., 1988, 60, pp. 1-82. Zbl0652.68017MR947532
  2. 2. D. BEAM, A. EHRENFEUCHT and MCNULTY, Avoidable Patterns in String of Symbols, Pacific J. of Maths, 1979, 85, pp. 261-294. Zbl0428.05001MR574919
  3. 3. J. BERSTEL, Some Recent Results on Square-Free Words. Techniques in M. FONTET, K. MEHLHORN Eds., STACS'84, Lecture Notes Comput. Sci., 1984, 166, pp.14-25. Zbl0582.68042MR773306
  4. 4. F. BRANDENBURG, Uniformely Growing k-th Power-Free Homomorphisms, Theor. Comp. Sci., 1983, 23, pp. 145-149. Zbl0508.68051MR693069
  5. 5. A. CARPI, On the Size of a Square-Free Morphism on a Three Letter Alphabet, Information Proces. Lett., 1983, 16, pp. 231-235. Zbl0508.68052MR709659
  6. 6. A. CARPI and A. DE LUCA, Square-Free Words on Partially Commutative Free Monoids, Information Proces. Lett., 1986, 22, pp. 125-131. Zbl0593.20065MR833176
  7. 7. P. CARTIER and D. FOATA, Problèmes combinatoires de commutation et réarrangements, Lecture Notes in Math., 1969, n° 5, Springer. Zbl0186.30101MR239978
  8. 8. R. CORI and D. PERRIN, Automates et Commutations Partielles, R.A.I.R.O. Informatique théorique, 1985, 19, p. 232. Zbl0601.68055MR795769
  9. 9. M. CROCHEMORE, Mots et Morphismes sans carré, Annals of Discrete Math., 1983, 17, pp. 235-245. Zbl0527.20045MR841299
  10. 10. M. LOTHAIRE, Combinatorics on Words, Addison Wesley, 1983. Zbl0514.20045MR675953
  11. 11. A. MAZURKIEWICZ, Concurrent Program Schemes and their Interpretations, DIA-MI-PB-78, Aarhus University, Aarhus, 1977. 
  12. 12. P. PLEASANTS, Non Repetitive Sequences, Proc. Cambridge. Phil. Soc., 1970, 68, pp. 267-274. Zbl0237.05010MR265173
  13. 13. R. SHELTON, A periodic Words on Three Symbols, I, II, J. Reine Angew. Math., 1981, 321, pp. 195-209; 1981, 327, pp. 1-11. Zbl0441.05007
  14. 14. R. SHELTON and R. SONI, Aperiodic Words on Three Symbols, III, J. Reine Angew. Math., 1982, 330, pp. 44-52. Zbl0467.05010MR641810
  15. 15. A. THUE, Uber unendliche Zeichenreihen, Norshe Vid. Selsk. Skr. J. Mat. Nat. Kl. Christiania, 1906, pp. 1-22. JFM39.0283.01

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

                
Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.