On reversibility in cellular automata

DOI10.1016/S0022-0000(75)80059-6zbMath0327.94064WikidataQ56621438 ScholiaQ56621438MaRDI QIDQ1226471

K. Appert

Publication date: 1975

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items

A cellular model of prisoners dilemma for ``prodding gratuity, Intractable problems in reversible cellular automata, Ternary reversible number-conserving cellular automata are trivial, The Representation Role for Basic Operations Embodied in Cellular Automata: A Suitability Example for Addition in Redundant Numeral Systems vs Conventional Ones, A survey of cellular automata: types, dynamics, non-uniformity and applications, Computation and construction universality of reversible cellular automata, Reversibility of non-saturated linear cellular automata on finite triangular grids, Applying cellular automata to complex environmental problems: The simulation of the bioremediation of contaminated soils, Reversibility of number-conserving 1D cellular automata: unlocking insights into the dynamics for larger state sets

Cites Work

• Unnamed Item
• Unnamed Item
• Tesselations with local transformations
• Decision procedures for surjectivity and injectivity of parallel maps for tessellation structures
• The Garden-of-Eden Theorem for Finite Configurations
• Cellular automata complexity trade-offs