scientific article; zbMATH DE number 1741020
From MaRDI portal
Publication:4331204
zbMATH Open1052.68090MaRDI QIDQ4331204FDOQ4331204
Authors: Jérôme O. Durand-Lose 
Publication date: 10 June 2002
Full work available at URL: http://www.emis.de/journals/DMTCS/proceedings/html/dmAA0110.abs.html
Title of this publication is not available (Why is that?)
Recommendations
- Representation of reversible cellular automata with block permutations
- Developments in Language Theory
- scientific article; zbMATH DE number 1189123
- Unconventional Computation
- scientific article; zbMATH DE number 6320145
- On the structure of the set of reversible cellular automata
- Computation in reversible cellular automata
- The complexity of reversible cellular automata
- Block invariance and reversibility of one dimensional linear cellular automata
Cited In (21)
- Reversibility vs Local Creation/Destruction
- Title not available (Why is that?)
- Sequentializing cellular automata
- Block representation of reversible causal graph dynamics
- Characterization of random fluctuation-based computation in cellular automata
- Reversible causal graph dynamics: invertibility, block representation, vertex-preservation
- An overview of quantum cellular automata
- Simulation and intrinsic universality among reversible cellular automata, the partition cellular automata leverage
- Sequentializing cellular automata
- Theory of cellular automata: a survey
- How to turn a second-order cellular automaton into a lattice gas: a new inversion scheme
- Reversible space-time simulation of cellular automata
- Reversible causal graph dynamics
- When-and how-can a cellular automaton be rewritten as a lattice gas?
- Reversible cellular automaton able to simulate any other reversible one using partitioning automata
- Surprising areas in the quest for small universal devices
- On the Collision-Propagation and Gather-Update Formulations of a Cellular Automata Rule
- Title not available (Why is that?)
- On fungal automata
- Representation of reversible cellular automata with block permutations
- Computational universality of fungal sandpile automata
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4331204)
