|
Trudy Matematicheskogo Instituta imeni V.A. Steklova, 2011, Volume 274, Pages 137–147
(Mi tm3330)
|
|
|
|
This article is cited in 2 scientific papers (total in 2 papers)
A palindromization map on free monoids
Aldo de Luca Dipartimento di Matematica e Applicazioni "R. Caccioppoli", Università degli Studi di Napoli Federico II, Napoli, Italy
Abstract:
This paper is a survey of several results of combinatorial nature which have been obtained starting from a palindromization map on a free monoid $A^*$ introduced by the author in 1997 in the case of a binary alphabet and, successively, generalized by other authors for arbitrary finite alphabets. If one extends the action of the palindromization map to infinite words, one can generate the class of all standard episturmian words, which includes standard Sturmian words and Arnoux–Rauzy words. In this framework, an essential role is played by the class of palindromic prefixes of all standard episturmian words called epicentral words. These words are precisely the images of $A^*$ under the palindromization map. Epicentral words have several different representations and satisfy interesting combinatorial properties. A further extension of the palindromization map to a $\vartheta$-palindromization map, where $\vartheta$ is an arbitrary involutory antimorphism of $A^*$, is also briefly discussed.
Received in November 2010
Citation:
Aldo de Luca, “A palindromization map on free monoids”, Algorithmic aspects of algebra and logic, Collected papers. Dedicated to Academician Sergei Ivanovich Adian on the occasion of his 80th birthday, Trudy Mat. Inst. Steklova, 274, MAIK Nauka/Interperiodica, Moscow, 2011, 137–147; Proc. Steklov Inst. Math., 274 (2011), 124–135
Linking options:
https://www.mathnet.ru/eng/tm3330 https://www.mathnet.ru/eng/tm/v274/p137
|
|