On quasiperiodic morphisms

DOI10.1007/978-3-642-40579-2_20MaRDI QIDQ2849988zbMATH OpenOpenAlexFDO

Authors Florence Levé, Gwénaël Richomme

Publication date 20 September 2013

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1304.6280

Mathematics Subject Classification ID

Combinatorics on words (68R15)

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.

Recommendations

• Quasiperiodic Sturmian words and morphisms
• On the periodicity of morphic words
• Determining sets of quasiperiods of infinite words
• Quasiperiods of infinite words
• On the power of periodic iteration of morphisms

Cited in

(13)

• Quasi-periodic decompositions and the Kemperman structure theorem
• Quasifibrations and Bott periodicity
• Quasi-total actions and translation numbers
• Quasiperiodic and Lyndon episturmian words
• Coverability and multi-scale coverability on infinite pictures
• On the periodicity of morphic words
• Minimal critical exponent of quasiperiodic words
• Determining sets of quasiperiods of infinite words
• scientific article; zbMATH DE number 1424284 (Why is no real title available?)
• Topology of quasi-periodic functions on the plane
• On quasiperiodic space tilings, inflation, and Dehn invariants
• Quasiperiodic version of Gordon's theorem
• Quasiperiodic Sturmian words and morphisms

This page was built for publication: On quasiperiodic morphisms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2849988)