Representation of reversible cellular automata with block permutations

DOI10.1007/BF01201813zbMath0840.68081WikidataQ56621444 ScholiaQ56621444MaRDI QIDQ4864445

Jarkko Kari

Publication date: 20 February 1996

Published in: Mathematical Systems Theory (Search for Journal in Brave)

zbMATH Keywords

cellular automata

Mathematics Subject Classification ID

68Q80: Cellular automata (computational aspects)

Related Items

Unnamed Item, Intrinsic universality of a 1-dimensional reversible Cellular Automaton, Universal groups of cellular automata, Simulation and Intrinsic Universality Among Reversible Cellular Automata, the Partition Cellular Automata Leverage, Reversibility vs Local Creation/Destruction, Transitive action on finite points of a full shift and a finitary Ryan’s theorem, TRANSITIVE BEHAVIOR IN REVERSIBLE ONE-DIMENSIONAL CELLULAR AUTOMATA WITH A WELCH INDEX 1, SPECTRAL PROPERTIES OF REVERSIBLE ONE-DIMENSIONAL CELLULAR AUTOMATA, Sequentializing cellular automata, Gate lattices and the stabilized automorphism group, An overview of quantum cellular automata, Reversible causal graph dynamics: invertibility, block representation, vertex-preservation, On the Interplay of Direct Topological Factorizations and Cellular Automata Dynamics on Beta-Shifts, Waiting for the rapture: what can we do with computers to (hopefully) witness the emergence of life?, Conserved quantities in discrete dynamics: what can be recovered from Noether's theorem, how, and why?, On time-symmetry in cellular automata, Index theory of one dimensional quantum walks and cellular automata, Elementary cellular automaton Rule 110 explained as a block substitution system. Rule 110 as a block substitution system, Characterization of random fluctuation-based computation in cellular automata, Sequentializing cellular automata, Procedures for calculating reversible one-dimensional cellular automata, Theory of cellular automata: a survey, How to turn a second-order cellular automaton into a lattice gas: a new inversion scheme, Structure of the invertible CA transformations group, Welch sets for random generation and representation of reversible one-dimensional cellular automata, When-and how-can a cellular automaton be rewritten as a lattice gas?, Block Representation of Reversible Causal Graph Dynamics, Direct topological factorization for topological flows, The Group of Reversible Turing Machines, Reversible Causal Graph Dynamics

Cites Work

• Invertible cellular automata: A review
• Reversible parallel computation: An evolving space-model
• Reversibility and surjectivity problems of cellular automata
• Classification of subshifts of finite type
• Tesselations with local transformations
• Eventual Extensions of Finite Codes
• Bicontinuous extensions of invertible combinatorial functions
• Endomorphisms and automorphisms of the shift dynamical system
• Unnamed Item
• Unnamed Item
• Unnamed Item