Access the full text.
Sign up today, get DeepDyve free for 14 days.
T. Hamachi, K. Inoue, Wolfgang Krieger (2009)
Subsystems of finite type and semigroup invariants of subshifts, 2009
Wolfgang Krieger (2012)
On subshift presentationsErgodic Theory and Dynamical Systems, 37
K. Inoue (2006)
The Zeta function, Periodic Points and Entropies of the Motzkin ShiftarXiv: Dynamical Systems
T. Ceccherini-Silberstein, M. Coornaert (2010)
Cellular Automata and Groups
D. Gonçalves, M. Sobottka, Charles Starling (2015)
TWO-SIDED SHIFT SPACES OVER INFINITE ALPHABETSJournal of the Australian Mathematical Society, 103
D. Gonccalves, M. Sobottka (2018)
Continuous shift commuting maps between ultragraph shift spacesDiscrete & Continuous Dynamical Systems - A
D. Lind, B. Marcus (1995)
An Introduction to Symbolic Dynamics and Coding
M. Tomforde (2001)
Simplicity of ultragraph algebrasIndiana University Mathematics Journal, 52
(1969)
Topological entropy of Enumerable Markov chains
R. Williams (1973)
Classification of subshifts of finite typeAnnals of Mathematics, 98
Tadeu Almeida, M. Sobottka (2020)
Blur shift spacesBulletin des Sciences Mathématiques
DA Lind, B Marcus (1995)
10.1017/CBO9780511626302An Introduction to Symbolic Dynamics and Coding
M. Sobottka, D. Gonçalves (2015)
A Note on the Definition of Sliding Block Codes and the Curtis-Hedlund-Lyndon TheoremJ. Cell. Autom., 12
Marie-Pierre Béal, Michel Blockelet, C. Dima (2013)
Finite-type-Dyck shift spacesArXiv, abs/1311.4223
O. Sarig (1999)
Thermodynamic formalism for countable Markov shiftsErgodic Theory and Dynamical Systems, 19
D. Gonçalves, M. Sobottka, Charles Starling (2015)
Sliding block codes between shift spaces over infinite alphabetsMathematische Nachrichten, 289
M. Mächler, P. Bühlmann (1999)
Variable Length Markov ChainsJournal of Computational and Graphical Statistics
J. Meddaugh, Brian Raines (2020)
A characterization of ω-limit sets in subshifts of Baire spaceJournal of Mathematical Analysis and Applications
Marie-Pierre Béal, Michel Blockelet, C. Dima (2013)
Sofic-Dyck shiftsTheor. Comput. Sci., 609
M Tomforde (2003)
Simplicity of ultragraph algebrasMath. J., 52
U. Darji, D. Gonccalves, M. Sobottka (2020)
Shadowing, finite order shifts and ultrametric spacesAdvances in Mathematics
N. Romero, A. Rovella, F. Vilamajó (2006)
Remark on cellular automata and shift preserving mapsAppl. Math. Lett., 19
C. Good, J. Meddaugh (2017)
Shifts of finite type as fundamental objects in the theory of shadowingInventiones mathematicae, 220
G. Hedlund (1969)
Endomorphisms and automorphisms of the shift dynamical systemMathematical systems theory, 3
H. Kamabe (2008)
Combinations of Context-Free Shifts and Shifts of Finite Type
T. Hamachi, Wolfgang Krieger (2013)
A construction of subshifts and a class of semigroupsErgodic Theory and Dynamical Systems, 41
J. Campos, N. Romero, R. Vivas (2021)
On the image set and reversibility of shift morphisms over discrete alphabetsRevista de la Unión Matemática Argentina
Publisher's Note Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations
The aim of this article is to find appropriate definitions for shifts of finite type and sofic shifts in a general context of symbolic dynamics, and to study their properties. We start showing that the classical definitions of shifts of finite type and sofic shifts, as they are given in the context of finite-alphabet shift spaces on the one-dimensional monoid N\documentclass[12pt]{minimal}\usepackage{amsmath}\usepackage{wasysym}\usepackage{amsfonts}\usepackage{amssymb}\usepackage{amsbsy}\usepackage{mathrsfs}\usepackage{upgreek}\setlength{\oddsidemargin}{-69pt}\begin{document}$$\mathbb {N}$$\end{document} or Z\documentclass[12pt]{minimal}\usepackage{amsmath}\usepackage{wasysym}\usepackage{amsfonts}\usepackage{amssymb}\usepackage{amsbsy}\usepackage{mathrsfs}\usepackage{upgreek}\setlength{\oddsidemargin}{-69pt}\begin{document}$$\mathbb {Z}$$\end{document} with the usual addition, do not fit for shift spaces over infinite alphabet or on other monoids. Therefore, by examining the core features in the classical definitions of shifts of finite type and sofic shifts, we propose general definitions that can be used in any context. The alternative definition given for shifts of finite type inspires the definition of a new class of shift spaces which intersects with the class of sofic shifts and includes shifts of finite type. This new class is named finitely defined shifts, and the non-finite-type shifts in it are named shifts of variable length. For the specific case of infinite-alphabet shifts on the lattice N\documentclass[12pt]{minimal}\usepackage{amsmath}\usepackage{wasysym}\usepackage{amsfonts}\usepackage{amssymb}\usepackage{amsbsy}\usepackage{mathrsfs}\usepackage{upgreek}\setlength{\oddsidemargin}{-69pt}\begin{document}$$\mathbb {N}$$\end{document} or Z\documentclass[12pt]{minimal}\usepackage{amsmath}\usepackage{wasysym}\usepackage{amsfonts}\usepackage{amssymb}\usepackage{amsbsy}\usepackage{mathrsfs}\usepackage{upgreek}\setlength{\oddsidemargin}{-69pt}\begin{document}$$\mathbb {Z}$$\end{document} with the usual addition, shifts of variable length can be interpreted as the topological version of variable length Markov chains.
"Bulletin of the Brazilian Mathematical Society, New Series" – Springer Journals
Published: Sep 1, 2022
Keywords: Symbolic dynamics; Formal languages; Cellular automata
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.