Decidable problems in substitution shifts

In this paper, we investigate the structure of the most general kind of substitution shifts, including non-minimal ones, and allowing erasing morphisms. We prove the decidability of many properties of these morphisms with respect to the shift space generated by iteration, such as aperiodicity, recog...

Full description

Saved in:
Bibliographic Details
Main Authors Béal, Marie-Pierre, Perrin, Dominique, Restivo, Antonio
Format Journal Article
LanguageEnglish
Published 29.12.2021
Subjects
Computer Science - Formal Languages and Automata Theory
Mathematics - Dynamical Systems
Online AccessGet full text

Cover

More Information
Summary:In this paper, we investigate the structure of the most general kind of substitution shifts, including non-minimal ones, and allowing erasing morphisms. We prove the decidability of many properties of these morphisms with respect to the shift space generated by iteration, such as aperiodicity, recognizability and (under an additional assumption) irreducibility, or minimality.
DOI:10.48550/arxiv.2112.14499