Pseudopalindrome closure operators in free monoids
- 1 October 2006
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 362 (1-3) , 282-300
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- COMBINATORIAL PROPERTIES OF STURMIAN PALINDROMESInternational Journal of Foundations of Computer Science, 2006
- Some characterizations of finite Sturmian wordsTheoretical Computer Science, 2006
- Episturmian morphisms and a Galois theorem on continued fractionsRAIRO - Theoretical Informatics and Applications, 2005
- Episturmian words and episturmian morphismsTheoretical Computer Science, 2002
- Episturmian words and some constructions of de Luca and RauzyTheoretical Computer Science, 2001
- On a paper by Castelli, Mignosi, RestivoRAIRO - Theoretical Informatics and Applications, 2000
- On the combinatorics of finite wordsTheoretical Computer Science, 1999
- Sturmian words: structure, combinatorics, and their arithmeticsTheoretical Computer Science, 1997
- Some combinatorial properties of Sturmian wordsTheoretical Computer Science, 1994
- On some combinatorial problems in free monoidsDiscrete Mathematics, 1982