On some factorizations of infinite words by elements of codes
Authors:
- J. JustinJJJ. Justin
- G. PirilloGPG. Pirillo
- 1 June 1997
- journal article
- Published by Elsevier in Information Processing Letters
- Vol. 62 (6) , 289-294
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Viennot factorization of infinite wordsInformation Processing Letters, 1996
- Palindromes in the Fibonacci wordInformation Processing Letters, 1995
- A division property of the Fibonacci wordInformation Processing Letters, 1995
- Infinite words and biprefix codesInformation Processing Letters, 1994
- FACTORIAL LANGUAGES AND SOME COMBINATORIAL PROPERTIES OF SEMIGROUPSInternational Journal of Algebra and Computation, 1993
- Symmetric Fibonacci WordsThe Fibonacci Quarterly, 1993
- Outfix and infix codes and related classes of languagesJournal of Computer and System Sciences, 1991
- Shirshov's theorem and ω-permutability of semigroupsAdvances in Mathematics, 1991
- Factorizations of free monoids and unavoidable regularitiesTheoretical Computer Science, 1990