On some problems related to palindrome closure-Reference-Cited by-同舟云学术

On some problems related to palindrome closure

Published:2008-01-15 Issue:4 Volume:42 Page:679-700
ISSN:0988-3754
Container-title:RAIRO - Theoretical Informatics and Applications
language:
Short-container-title:RAIRO-Theor. Inf. Appl.

Author:

Bucci Michelangelo,de Luca Aldo,De Luca Alessandro,Zamboni Luca Q.

Publisher

EDP Sciences

Subject

Computer Science Applications,General Mathematics,Software

Link

http://www.rairo-ita.org/10.1051/ita:2007064/pdf

Reference11 articles.

1. V. Anne, L.Q. Zamboni and I. Zorca, Palindromes and pseudo-palindromes in episturmian and pseudo-palindromic infinite words, inWords 2005, number 36 in Publications du LaCIM, edited by S. Brlek and C. Reutenauer (2005) 91–100.

2. J. Berstel and D. Perrin,Theory of Codes. Academic Press (1985).

3. J. Berstel and P. Séébold, Sturmian words, inAlgebraic Combinatorics on Words, edited by M. Lothaire. Cambridge University Press, Cambridge UK (2002). Chapter 2.

4. M. Bucci, A. de Luca, A. De Luca and L.Q. Zamboni, On different generalizations of episturmian words.Theor. Comput. Sci., to appear.

5. Sturmian words: structure, combinatorics, and their arithmetics

Cited by 12 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Normalization of ternary generalized pseudostandard words;Theoretical Computer Science;2019-08

2. A generalized palindromization map in free monoids;Theoretical Computer Science;2012-10

3. A palindromization map on free monoids;Proceedings of the Steklov Institute of Mathematics;2011-10

4. On the fixed points of the iterated pseudopalindromic closure operator;Theoretical Computer Science;2011-06

5. On the number of episturmian palindromes;Theoretical Computer Science;2010-09