Morphic sequences: complexity and decidability

DOI10.4204/EPTCS.403.24MaRDI QIDQ6934107zbMATH OpenFDO

Authors Raphaël Henry

Publication date 3 September 2025

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.4204/EPTCS.403.24

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Cites work

• Complexité des facteurs des mots infinis engendrés par morphismes itérés
• Decidability of periodicity for infinite words
• Decidability of the HD0L ultimate periodicity problem
• Factor complexity
• scientific article; zbMATH DE number 3588051 (Why is no real title available?)
• On the periodicity of morphisms on free monoids

This page was built for publication: Morphic sequences: complexity and decidability

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