On the image set and reversibility of shift morphisms over discrete alphabets
From MaRDI portal
Publication:5101868
DOI10.33044/revuma.1795zbMath1504.37016arXiv2106.09808OpenAlexW3176744677MaRDI QIDQ5101868
Jorge Campos, Neptalí Romero, Ramón Vivas
Publication date: 2 September 2022
Published in: Revista de la Unión Matemática Argentina (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2106.09808
Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Dynamical aspects of cellular automata (37B15) Symbolic dynamics (37B10)
Related Items (1)
Cites Work
- Unnamed Item
- On the reversibility and the closed image property of linear cellular automata
- A Curtis-Hedlund-Lyndon theorem for Besicovitch and Weyl spaces
- Reversible computing and cellular automata -- a survey
- Theory of relations. Transl. from the French by P. Clote
- Endomorphisms of symbolic algebraic varieties
- Symbolic dynamics. One-sided, two-sided and countable state Markov shifts
- Topological invariants of dynamical systems and spaces of holomorphic maps. I.
- Remark on cellular automata and shift preserving maps
- Canonical forms of shift-invariant maps on \([\mathbb N^{\infty}\)]
- Tesselations with local transformations
- Sliding block codes between shift spaces over infinite alphabets
- Cellular Automata on Group Sets and the Uniform Curtis-Hedlund-Lyndon Theorem
- Cellular Automata and Groups
- Induction and restriction of cellular automata
- TWO-SIDED SHIFT SPACES OVER INFINITE ALPHABETS
- An Introduction to Symbolic Dynamics and Coding
- Thermodynamic formalism for countable Markov shifts
- A note on the definition of sliding block codes and the Curtis-Hedlund-Lyndon Theorem
- One-sided shift spaces over infinite alphabets
- Endomorphisms and automorphisms of the shift dynamical system
This page was built for publication: On the image set and reversibility of shift morphisms over discrete alphabets
