Recognizability in S-adic shifts - Institut de Recherche en Informatique Fondamentale Access content directly
Preprints, Working Papers, ... Year : 2023

Recognizability in S-adic shifts

Abstract

We investigate questions related to the notion of recognizability of sequences of morphisms, a generalization of Mossé's Theorem. We consider the most general class of morphisms including ones with erasable letters. The main result states that a sequence of morphisms with bounded alphabet size is eventually recognizable for aperiodic points, improving and simplifying a result of Berthé et al. (2019). This also provides a new simple proof for the recognizability of a single morphism on its shift space. The main ingredient of the proof are elementary morphisms.
Fichier principal
Vignette du fichier
recognizabilitySadic.pdf (147.09 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
licence : CC BY - Attribution

Dates and versions

hal-03983501 , version 1 (10-02-2023)

Identifiers

Cite

Marie-Pierre Béal, Dominique Perrin, Antonio Restivo, Wolfgang Steiner. Recognizability in S-adic shifts. 2023. ⟨hal-03983501⟩
8 View
9 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More