Abstract
We introduce the inner palindromic closure as a new operation spadesuit sign, which consists in expanding a factor u to the left or right by v such that vu or uv, respectively, is a palindrome of minimal length. We investigate several language theoretic properties of the iterated inner palindromic closure spadesuit sign*(w) = Ui≥0 spadesuit signi(w) of a word w. © 2013 Springer-Verlag.
Cite
CITATION STYLE
Dassow, J., Manea, F., Mercaş, R., & Müller, M. (2013). Inner palindromic closure. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7907 LNCS, pp. 155–166). https://doi.org/10.1007/978-3-642-38771-5_15
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
