Block representation of reversible causal graph dynamics
DOI10.1007/978-3-319-22177-9_27zbMATH Open1436.68204OpenAlexW2262602498MaRDI QIDQ2947893FDOQ2947893
Authors: Pablo Arrighi, Simon Martiel, Simon Perdrix 
Publication date: 29 September 2015
Published in: Fundamentals of Computation Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-22177-9_27
Recommendations
Graph theory (including graph drawing) in computer science (68R10) Cellular automata (computational aspects) (68Q80) Networks and circuits as models of computation; circuit complexity (68Q06)
Cites Work
- Causal Graph Dynamics
- Representation of reversible cellular automata with block permutations
- Endomorphisms and automorphisms of the shift dynamical system
- Unitarity plus causality implies localizability
- Computation-universality of one-dimensional one-way reversible cellular automata
- Parallel and distributed derivations in the single-pushout approach
- Amalgamation of graph transformations: a synchronization mechanism
- Graph automata: Natural expression of self-reproduction
- Parallel high-level replacement systems
- Title not available (Why is that?)
- Partitioned quantum cellular automata are intrinsically universal
- Title not available (Why is that?)
- Block representation of reversible causal graph dynamics
Cited In (8)
- Reversibility vs Local Creation/Destruction
- An intrinsically universal family of causal graph dynamics
- Block representation of reversible causal graph dynamics
- Intrinsic universality of causal graph dynamics
- Reversible causal graph dynamics: invertibility, block representation, vertex-preservation
- Causal graph dynamics
- Reversible causal graph dynamics
- Topological reversibility and causality in feed-forward networks
This page was built for publication: Block representation of reversible causal graph dynamics
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2947893)
