The palindromization map
Dominique Perrin, Christophe Reutenauer
TL;DR
This paper extends the palindromization map, originally defined for Sturmian words and free groups, to arbitrary alphabets and explores the automata associated with these palindromized words.
Contribution
It generalizes the palindromization map to any alphabet and studies the automata structures of the resulting words.
Findings
Extended palindromization map to arbitrary alphabets
Analyzed suffix automaton of palindromized words
Investigated compact suffix automaton properties
Abstract
The palindromization map has been defined initially by Aldo de Luca in the context of Sturmian words. It was extended to the free group of rank by Kassel and the second autho We extend their construction to arbitrary alphabets. We also investigate the suffix automaton and compact suffix automaton of the words obtained by palindromization.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
Topicssemigroups and automata theory · Natural Language Processing Techniques · Algorithms and Data Compression