On time-symmetry in cellular automata
From MaRDI portal
Publication:439976
DOI10.1016/J.JCSS.2012.01.006zbMATH Open1244.68055OpenAlexW1975307939WikidataQ62045918 ScholiaQ62045918MaRDI QIDQ439976FDOQ439976
Authors: Anahí Gajardo, Jarkko Kari, Andrés Moreira 
Publication date: 17 August 2012
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jcss.2012.01.006
Recommendations
Cites Work
- Representation of reversible cellular automata with block permutations
- Endomorphisms and automorphisms of the shift dynamical system
- Bulking II: Classifications of cellular automata
- Time-reversal symmetry in dynamical systems: a survey
- Reversibility and surjectivity problems of cellular automata
- Complexity of Langton's ant
- Decision procedures for surjectivity and injectivity of parallel maps for tessellation structures
- The undecidability of the domino problem
- Periodicity and Immortality in Reversible Computing
- Reversibility of 2D cellular automata is undecidable
- Title not available (Why is that?)
- Developments in Language Theory
- Invertible cellular automata: A review
Cited In (17)
- Cold dynamics in cellular automata: a tutorial
- Decidability and undecidability in cellular automata
- A closed formula for the inverse of a reversible cellular automaton with \((2 R + 1)\)-cyclic rule
- Gliders in the game of life and in a reversible cellular automaton
- Aspects of reversibility for classical automata
- Fractional-time states of cellular automata
- Constructive chaos by cellular automata and possible sources of an arrow of time
- A toy model provably featuring an arrow of time without past hypothesis
- A small minimal aperiodic reversible Turing machine
- Finite automata with undirected state graphs
- Title not available (Why is that?)
- Statistical equilibrium in deterministic cellular automata
- Selfsimilarity, simulation and spacetime symmetries
- Characterizing asymptotic randomization in abelian cellular automata
- Freezing, bounded-change and convergent cellular automata
- Universal time-symmetric number-conserving cellular automaton
- On relations between properties in transitive Turing machines
This page was built for publication: On time-symmetry in cellular automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q439976)
