Intrinsic universality in automata networks. III: On symmetry versus asynchrony
From MaRDI portal
Publication:6646448
DOI10.1016/J.TCS.2024.114890MaRDI QIDQ6646448
Martín Ríos-Wilson, Guillaume Theyssier
Publication date: 2 December 2024
Published in: Theoretical Computer Science (Search for Journal in Brave)
Cites Work
- Disjunctive networks and update schedules
- Computational complexity of threshold automata networks under different updating schemes
- Memoryless computation: new results, constructions, and extensions
- Reaction-diffusion automata: Three states implies universality
- PSPACE-completeness of majority automata networks
- Decreasing energy functions as a tool for studying threshold networks
- Itérations sur des ensembles finis et automates cellulaires contractants
- Periodic behaviour of generalized threshold functions
- Fixed points in conjunctive networks and maximal independent sets in graph contractions
- Blocs-H-matrices et convergence des méthodes itératives classiques par blocs
- Cellular graph automata. I. basic concepts, graph property measurement, closure properties
- Cellular graph automata. II. graph and subgraph isomorphism, graph structure recognition
- On the Sequence of Consecutive Powers of a Matrix in a Boolean Algebra
- A logical calculus of the ideas immanent in nervous activity
- On the effects of firing memory in the dynamics of conjunctive networks
- Intrinsic universality in automata networks. I: Families and simulations
- About block-parallel Boolean networks: a position paper
- On the influence of the interaction graph on a finite dynamical system
- Attractor landscapes in Boolean networks with firing memory: a theoretical study applied to genetic networks
- Intrinsic universality in automata networks. II: Glueing and gadgets
This page was built for publication: Intrinsic universality in automata networks. III: On symmetry versus asynchrony
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6646448)
