On simulation in automata networks
From MaRDI portal
Publication:2106612
DOI10.1007/978-3-030-51466-2_24OpenAlexW3037077222MaRDI QIDQ2106612
Florian Bridoux, Guillaume Theyssier, Maximilien Gadouleau
Publication date: 16 December 2022
Full work available at URL: https://arxiv.org/abs/2001.09198
Cites Work
- Unnamed Item
- Unnamed Item
- Simple dynamics on graphs
- Disjunctive networks and update schedules
- Memoryless computation: new results, constructions, and extensions
- PSPACE-completeness of majority automata networks
- Classical finite transformation semigroups. An introduction.
- Computation on binary tree-networks
- Closed iterative calculus
- Graph puzzles, homotopy, and the alternating group
- Commutative automata networks
- Complete simulation of automata networks
- Mapping Computation with No Memory
- Cellular graph automata. I. basic concepts, graph property measurement, closure properties
- Cellular graph automata. II. graph and subgraph isomorphism, graph structure recognition
- Computing in permutation groups without memory
- Synchronism versus asynchronism in monotonic Boolean automata networks
- On the influence of the interaction graph on a finite dynamical system
