Papers
Topics
Authors
Recent
Search
2000 character limit reached

Morphic Sequences: Complexity and Decidability

Published 24 Jun 2024 in cs.DM | (2406.16406v1)

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.

Summary

No one has generated a summary of this paper yet.

Sign Up to Summarize

Paper to Video (Beta)

No one has generated a video about this paper yet.

Sign Up to Generate All Videos Subscribe on YouTube

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Sign Up to Generate

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Generate Now

Continue Learning

We haven't generated follow-up questions for this paper yet.

Generate Now

Authors (1)

  1. Raphael Henry 

Collections

Sign up for free to add this paper to one or more collections.

Sign Up