On simulation in automata networks
From MaRDI portal
Publication:2106612
Recommendations
Cites work
- Cellular graph automata. I. basic concepts, graph property measurement, closure properties
- Cellular graph automata. II. graph and subgraph isomorphism, graph structure recognition
- Classical finite transformation semigroups. An introduction.
- Closed iterative calculus
- Commutative automata networks
- Complete simulation of automata networks
- Computation on binary tree-networks
- Computation with no memory, and rearrangeable multicast networks
- Computing in permutation groups without memory
- Disjunctive networks and update schedules
- Graph puzzles, homotopy, and the alternating group
- scientific article; zbMATH DE number 789816 (Why is no real title available?)
- Mapping Computation with No Memory
- Memoryless computation: new results, constructions, and extensions
- On the influence of the interaction graph on a finite dynamical system
- PSPACE-completeness of majority automata networks
- Simple dynamics on graphs
- Synchronism versus asynchronism in monotonic Boolean automata networks
Cited in
(6)- Weak Invariant Simulation and Its Application to Analysis of Parameterized Networks
- scientific article; zbMATH DE number 8122 (Why is no real title available?)
- Intrinsic universality in automata networks. I: Families and simulations
- Intrinsic universality in automata networks. II: Glueing and gadgets
- Computational complexity of minimal trap spaces in Boolean networks
- Intrinsic universality in automata networks. III: On symmetry versus asynchrony
This page was built for publication: On simulation in automata networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2106612)
