From additive flowers to additive automata networks

DOI10.1007/978-3-030-92551-2_18OpenAlexW4225816521MaRDI QIDQ2086735

Adrien Richard, Christophe Papazian, Enrico Formenti, Pierre-Alain Scribot

Publication date: 25 October 2022

Full work available at URL: https://doi.org/10.1007/978-3-030-92551-2_18

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Related Items

Complexity of local, global and universality properties in finite dynamical systems

Cites Work

• Disjunctive networks and update schedules
• Positive and negative cycles in Boolean networks
• Non-Unique Factorization of Polynomials Over Residue Class Rings of the Integers
• Fixed Points and Attractors of Reaction Systems
• On the influence of the interaction graph on a finite dynamical system
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: From additive flowers to additive automata networks