Morphic Sequences: Complexity and Decidability
arXiv:2406.16406 · doi:10.4204/EPTCS.403.24
Abstract
In this work we recall Pansiot's result on the complexity of pure morphic sequences and we use the tools developed by Devyatov for morphic sequences to prove the decidability of the complexity class of pure morphic sequences.
arXiv commentIn Proceedings GASCom 2024, arXiv:2406.14588