Abstract
Weakly and strongly quasiperiodic morphisms are tools introduced to study quasiperiodic words. Formally they map respectively at least one or any non-quasiperiodic word to a quasiperiodic word. Considering them both on finite and infinite words, we get four families of morphisms between which we study relations. We provide algorithms to decide whether a morphism is strongly quasiperiodic on finite words or on infinite words. © 2013 Springer-Verlag Berlin Heidelberg.
Cite
CITATION STYLE
Levé, F., & Richomme, G. (2013). On quasiperiodic morphisms. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8079 LNCS, pp. 181–192). Springer Verlag. https://doi.org/10.1007/978-3-642-40579-2_20
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
