Showing 2024Show all
2 papers · 1 filter
cs.DM2024
Rice-like complexity lower bounds for Boolean and uniform automata networks
Aliénor Goubault-Larrecq, Kévin Perrot
Automata networks are a versatile model of finite discrete dynamical systems composed of interacting entities (the automata), able to embed any directed graph as a dynamics on its…
cs.DM2024
Complexity of Boolean automata networks under block-parallel update modes
Kévin Perrot, Sylvain Sené, Léah Tapin
Boolean automata networks (aka Boolean networks) are space-time discrete dynamical systems, studied as a model of computation and as a representative model of natural phenomena. A…