Category theory of symbolic dynamics
From MaRDI portal
Publication:487987
DOI10.1016/J.TCS.2014.10.023zbMATH Open1314.37011arXiv1309.2456OpenAlexW1990210371MaRDI QIDQ487987FDOQ487987
Authors: Ilkka A. Törmä, Ville Salo 
Publication date: 23 January 2015
Published in: Theoretical Computer Science (Search for Journal in Brave)
Abstract: We study the central objects of symbolic dynamics, that is, subshifts and block maps, from the perspective of basic category theory, and present several natural categories with subshifts as objects and block maps as morphisms. Our main goals are to find universal objects in these symbolic categories, to classify their block maps based on their category theoretic properties, and to establish as many natural properties (finite completeness, regularity etc.) as possible. Existing definitions in category theory suggest interesting new problems for block maps. Our main technical contributions are the solution to the dual problem of the Extension Lemma and results on certain types of conserved quantities, suggested by the concept of a coequalizer.
Full work available at URL: https://arxiv.org/abs/1309.2456
Recommendations
Formal languages and automata (68Q45) Symbolic dynamics (37B10) Categories of machines, automata (18B20)
Cites Work
- An Introduction to Symbolic Dynamics and Coding
- Endomorphisms and automorphisms of the shift dynamical system
- Symbolic dynamics. One-sided, two-sided and countable state Markov shifts
- Some properties of cellular automata with equicontinuity points
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Introduction to extensive and distributive categories
- Title not available (Why is that?)
- Lower entropy factors of sofic systems
- A Note on Minimal Covers for Sofic Systems
- Sensitivity and topological mixing are undecidable for reversible one-dimensional cellular automata
- On the structure of a sofic shift space
- Title not available (Why is that?)
- A Characterization of Cellular Automata Generated by Idempotents on the Full Shift
- Cellular automata reversible over limit set
- Weak equivalence for shifts of finite type
Cited In (7)
- Symbolic dynamics and the category of graphs
- Coloring Problems for Infinite Words
- Recoding Lie algebraic subshifts
- A categorical approach to open and interconnected dynamical systems
- MONOCHROMATIC FACTORIZATIONS OF WORDS AND PERIODICITY
- Morphisms of discrete dynamical systems
- On von Neumann regularity of cellular automata
This page was built for publication: Category theory of symbolic dynamics
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q487987)
