The palindromization map
From MaRDI portal
Publication:6048431
DOI10.1016/j.dam.2023.07.008arXiv2211.10638MaRDI QIDQ6048431
Dominique Perrin, Christophe Reutenauer
Publication date: 14 September 2023
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2211.10638
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Sturmian graphs and integer representations over numeration systems
- Special factors and the combinatorics of suffix and factor automata
- On Sturmian graphs
- The smallest automaton recognizing the subwords of a text
- Deterministic generalized automata
- Sturmian words: structure, combinatorics, and their arithmetics
- EERTREE: an efficient data structure for processing palindromes in strings
- Sturmian numeration systems and decompositions to palindromes
- On-line construction of compact directed acyclic word graphs
- Average sizes of suffix trees and DAWGs
- A noncommutative extension of Mahler's interpolation theorem
- Combinatorial pattern matching. 8th annual symposium, CPM '97, Aarhus, Denmark, June 30 -- July 2, 1997. Proceedings
- A palindromization map for the free group
- A characterization of infinite LSP words
- Représentation géométrique de suites de complexité $2n+1$
- Episturmian morphisms and a Galois theorem on continued fractions
- From Christoffel Words to Markoff Numbers
- Dimension Groups and Dynamical Systems
- Profinite Semigroups and Symbolic Dynamics
- Complete inverted files for efficient text retrieval and analysis
- Suffix Automata and Standard Sturmian Words
- Profinite Groups
- A topology for free groups and related groups
- Episturmian words and some constructions of de Luca and Rauzy
This page was built for publication: The palindromization map
