Morphic Sequences: Complexity and Decidability
Raphael Henry (I2M, Aix-Marseille Universit\'e)
TL;DR
This paper reviews the complexity of pure morphic sequences and establishes the decidability of their complexity class using advanced theoretical tools.
Contribution
It proves the decidability of the complexity class of pure morphic sequences, building on Pansiot's and Devyatov's foundational work.
Findings
Decidability of the complexity class for pure morphic sequences.
Extension of previous results on morphic sequence complexity.
Application of Devyatov's tools to establish new theoretical results.
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.