Decidable problems in substitution shifts
Dynamical Systems
2024-04-03 v8 Formal Languages and Automata Theory
Abstract
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.
Cite
@article{arxiv.2112.14499,
title = {Decidable problems in substitution shifts},
author = {Marie-Pierre Béal and Dominique Perrin and Antonio Restivo},
journal= {arXiv preprint arXiv:2112.14499},
year = {2024}
}