Free Access
Issue |
RAIRO-Theor. Inf. Appl.
Volume 24, Number 6, 1990
|
|
---|---|---|
Page(s) | 509 - 520 | |
DOI | https://doi.org/10.1051/ita/1990240605091 | |
Published online | 01 February 2017 |
- 1. I. J. AALBERSBERG and G. ROZENBERG, Theory of Traces, Theor. Comp. Sci., 1988, 60, pp. 1-82. [MR: 947532] [Zbl: 0652.68017] [Google Scholar]
- 2. D. BEAM, A. EHRENFEUCHT and MCNULTY, Avoidable Patterns in String of Symbols, Pacific J. of Maths, 1979, 85, pp. 261-294. [MR: 574919] [Zbl: 0428.05001] [Google Scholar]
- 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. [MR: 773306] [Zbl: 0582.68042] [Google Scholar]
- 4. F. BRANDENBURG, Uniformely Growing k-th Power-Free Homomorphisms, Theor. Comp. Sci., 1983, 23, pp. 145-149. [MR: 693069] [Zbl: 0508.68051] [Google Scholar]
- 5. A. CARPI, On the Size of a Square-Free Morphism on a Three Letter Alphabet, Information Proces. Lett., 1983, 16, pp. 231-235. [MR: 709659] [Zbl: 0508.68052] [Google Scholar]
- 6. A. CARPI and A. DE LUCA, Square-Free Words on Partially Commutative Free Monoids, Information Proces. Lett., 1986, 22, pp. 125-131. [MR: 833176] [Zbl: 0593.20065] [Google Scholar]
- 7. P. CARTIER and D. FOATA, Problèmes combinatoires de commutation et réarrangements, Lecture Notes in Math., 1969, n° 5, Springer. [MR: 239978] [Zbl: 0186.30101] [Google Scholar]
- 8. R. CORI and D. PERRIN, Automates et Commutations Partielles, R.A.I.R.O. Informatique théorique, 1985, 19, p. 232. [EuDML: 92219] [MR: 795769] [Zbl: 0601.68055] [Google Scholar]
- 9. M. CROCHEMORE, Mots et Morphismes sans carré, Annals of Discrete Math., 1983, 17, pp. 235-245. [MR: 841299] [Zbl: 0527.20045] [Google Scholar]
- 10. M. LOTHAIRE, Combinatorics on Words, Addison Wesley, 1983. [MR: 675953] [Zbl: 0514.20045] [Google Scholar]
- 11. A. MAZURKIEWICZ, Concurrent Program Schemes and their Interpretations, DIA-MI-PB-78, Aarhus University, Aarhus, 1977. [Google Scholar]
- 12. P. PLEASANTS, Non Repetitive Sequences, Proc. Cambridge. Phil. Soc., 1970, 68, pp. 267-274. [MR: 265173] [Zbl: 0237.05010] [Google Scholar]
- 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. [EuDML: 152316] [Zbl: 0441.05007] [Google Scholar]
- 14. R. SHELTON and R. SONI, Aperiodic Words on Three Symbols, III, J. Reine Angew. Math., 1982, 330, pp. 44-52. [EuDML: 152403] [MR: 641810] [Zbl: 0467.05010] [Google Scholar]
- 15. A. THUE, Uber unendliche Zeichenreihen, Norshe Vid. Selsk. Skr. J. Mat. Nat. Kl. Christiania, 1906, pp. 1-22. [JFM: 39.0283.01] [Google Scholar]
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.