Morphic Sequences: Complexity and Decidability
<|reference_start|>Morphic Sequences: Complexity and Decidability: 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.<|reference_end|>
@article{henry2024morphic,
    title={Morphic Sequences: Complexity and Decidability},
    author={Raphael Henry (I2M, Aix-Marseille Universit'e)},
    journal={EPTCS 403, 2024, pp. 113-117},
    year={2024},
    doi={10.4204/EPTCS.403.24},
    archivePrefix={arXiv},
    eprint={2406.16406},
    primaryClass={cs.DM}
}