A combinatorial theorem on -power-free words and an application to semigroups

Aldo de Luca; Stefano Varricchio

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

  • Volume: 24, Issue: 3, page 205-228
  • ISSN: 0988-3754

How to cite

top

de Luca, Aldo, and Varricchio, Stefano. "A combinatorial theorem on $p$-power-free words and an application to semigroups." RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications 24.3 (1990): 205-228. <http://eudml.org/doc/92356>.

@article{deLuca1990,
author = {de Luca, Aldo, Varricchio, Stefano},
journal = {RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications},
keywords = {infinite words; subword complexity},
language = {eng},
number = {3},
pages = {205-228},
publisher = {EDP-Sciences},
title = {A combinatorial theorem on $p$-power-free words and an application to semigroups},
url = {http://eudml.org/doc/92356},
volume = {24},
year = {1990},
}

TY - JOUR
AU - de Luca, Aldo
AU - Varricchio, Stefano
TI - A combinatorial theorem on $p$-power-free words and an application to semigroups
JO - RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
PY - 1990
PB - EDP-Sciences
VL - 24
IS - 3
SP - 205
EP - 228
LA - eng
KW - infinite words; subword complexity
UR - http://eudml.org/doc/92356
ER -

References

top
  1. 1. J. BERSTEL, Mots de Fibonacci, Seminaire d'Informatique Théorique, L.I.T.P. Université Paris-VI et VII, Année 1980/81, pp. 57-78. 
  2. 2. R. D. BLYTH, Rewriting Products of Groups Elements, Ph. D. Thesis, 1987, University of Illinois at Urbana-Champain. MR2635772
  3. 3. A. DE LUCA and S. VARRICCHIO, Some Combinatorial Properties of the Thue-Morse Sequence and a Problem in Semigroups, Theoretical Computer Science, Vol. 63, 1989, pp. 333-348. Zbl0671.10050MR993769
  4. 4. A. DE LUCA and S. VARRICCHIO, On the Factors of the Thue-Morse Word on Three Symbols, Information Processing Letters, Vol. 27, 1988, pp. 281-285. Zbl0746.68067MR947256
  5. 5. A. EHRENFEUCHT and G. ROZENBERG, On the Subword Compîexity of DOL Languages with a Constant Distribution, Information Processing Letters, Vol. 13, 1981, pp. 108-113. Zbl0546.68062MR645455
  6. 6. A. EHRENFEUCHT and G. ROZENBERG, On the Subword Complexity of Square-Free DOL Languages, Theoretical Computer Science, Vol. 16, 1981, pp. 25-32. Zbl0481.68073MR632668
  7. 7. J. KARHUMAKI, On Cube-Free w-Words Generated by Binary Morphisms, Discrete Applied Mathematics, Vol. 5, 1983, pp. 279-297. Zbl0505.03022MR690339
  8. 8. M. LOTHAIRE, Combinatorics on Words, Addition Wesley, Reading, MA, 1983. Zbl0514.20045MR675953
  9. 9. A. RESTIVO and C. REUTENAUER, On the Burnside Problem for Semigroups, J. of Algebra, Vol. 89, 1984, pp. 102-104. Zbl0545.20051MR748230
  10. 10. A. RESTIVO, Permutation Properties and the Fibonacci Semigroup, Semigroup Forum, Vol. 38, 1989, pp. 337-345. Zbl0663.20063MR982013

NotesEmbed ?

top

You must be logged in to post comments.