Morphic Sequences: Complexity and Decidability

Fuente: arXiv
Enregistré dans:
Détails bibliographiques
Auteur principal: Henry, Raphael
Format: Preprint
Publié: 2024
Sujets:
Accès en ligne:
Tags: Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
_version_ 1866914846946099200
author Henry, Raphael
author_facet Henry, Raphael
contents 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.
format Preprint
id arxiv_https___arxiv_org_abs_2406_16406
institution arXiv
publishDate 2024
record_format arxiv
spellingShingle Morphic Sequences: Complexity and Decidability
Henry, Raphael
Discrete Mathematics
G.2.1.
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.
title Morphic Sequences: Complexity and Decidability
topic Discrete Mathematics
G.2.1.
url https://arxiv.org/abs/2406.16406