Property of nested cylinders, sofics and their morphisms

DOI10.1007/S00574-025-00466-3MaRDI QIDQ6945742zbMATH OpenFDO

Authors Roozbeh Tahamtan, Dawoud Ahmadi Dastjerdi

Publication date 8 August 2025

Published in Bulletin of the Brazilian Mathematical Society. New Series (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S00574-025-00466-3

zbMATH Keywords

generalized sliding block codeproperty of nested cylindersshift spaceshifts of finite type

Mathematics Subject Classification ID

Symbolic dynamics (37B10) Multidimensional shifts of finite type (37B51)

Review text

This paper is a natural progression of ideas from a 2022 paper of \textit{M. Sobottka} [Bull. Braz. Math. Soc. (N.S.) 53, No. 3, 981--1031 (2022; Zbl 1507.37014)] concerning shift spaces \(\mathcal{A}^{\mathbb{M}}\), where \(\mathcal{A}\) may be an infinite alphabet and/or \(\mathbb{M}\) is treated as a monoid. In particular, the paper compares and contrasts this scenario with the conventional case where \(\mathcal{A}\) is a finite alphabet.\N\NThe main portion of the paper considers the shift spaces \(\Lambda\subset \mathcal{A}^{\mathbb{M}}\) which have the property of nested cylinders, namely when an infinite intersection of non-empty nested cylinders is nonempty and thus mimics the finite alphabet scenario. The paper defines what it means for a sequence of non-empty nested cylinders to be minimal and explores the relationship between that minimality and the property of nested cylinders, providing illustrative examples. Also included are some results about shifts of finite type (SFT), including an example of a non-Markovian SFT that does not have the property of nested cylinders, in contrast to the Markovian result from a 2025 paper of \textit{M. Sobottka} [Bull. Braz. Math. Soc. (N.S.) 56, No. 3, Paper No. 50, 9 p. (2025; Zbl 08108153)]. The paper additionally defines what it means for a sliding-block-code to be ``decent and shows that for certain monoids, the image of a SFT under a decent sliding-block-code is closed.

Cites work

• An introduction to symbolic dynamics and coding
• Cellular automata and groups
• Intrinsic Markov Chains
• Remark on cellular automata and shift preserving maps
• Some notes on the classification of shift spaces: shifts of finite type; sofic shifts; and finitely defined shifts
• Symbolic dynamics.
• Topological and Ergodic Theory of Symbolic Dynamics

This page was built for publication: Property of nested cylinders, sofics and their morphisms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6945742)