RAIRO-Theor. Inf. Appl.
Volume 42, Number 4, October-December 2008Fibonacci words
|Page(s)||679 - 700|
|Section||Topical issue: Fibonacci Words|
|Published online||15 January 2008|
On some problems related to palindrome closure
Dipartimento di Matematica e Applicazioni “R. Caccioppoli”,
Università degli Studi di Napoli Federico II. Via Cintia, Monte S. Angelo, I-80126 Napoli,
Italy; email@example.com; firstname.lastname@example.org; email@example.com
2 Department of Mathematics, PO Box 311430, University of North Texas. Denton TX, USA; firstname.lastname@example.org
Accepted: 4 December 2007
In this paper, we solve some open problems related to (pseudo)palindrome closure operators and to the infinite words generated by their iteration, that is, standard episturmian and pseudostandard words. We show that if ϑ is an involutory antimorphism of A*, then the right and left ϑ-palindromic closures of any factor of a ϑ-standard word are also factors of some ϑ-standard word. We also introduce the class of pseudostandard words with “seed”, obtained by iterated pseudopalindrome closure starting from a nonempty word. We show that pseudostandard words with seed are morphic images of standard episturmian words. Moreover, we prove that for any given pseudostandard word s with seed, all sufficiently long left special factors of s are prefixes of it.
Mathematics Subject Classification: 68R15
Key words: Palindromes / palindrome closures / Sturmian and episturmian words / involutory antimorphisms / pseudopalindromes / pseudostandard words.
© EDP Sciences, 2008
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.