Decidable problems in substitution shifts - Université Gustave Eiffel Accéder directement au contenu
Pré-Publication, Document De Travail Année : 2021

Decidable problems in substitution shifts

Résumé

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.

Dates et versions

hal-04491377 , version 1 (06-03-2024)

Identifiants

Citer

Marie-Pierre Béal, Dominique Perrin, Antonio Restivo. Decidable problems in substitution shifts. 2023. ⟨hal-04491377⟩
14 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More