1 citations · 2 across the 8 of their papers we have counts for
3 papers · 1 filter
On the Dynamics of Bounded-Degree Automata Networks
Julio Aracena, Florian Bridoux, Maximilien Gadouleau +4
Automata networks can be seen as bare finite dynamical systems, but their growing theory has shown the importance of the underlying communication graph of such networks. This paper…
Commutative automata networks
Florian Bridoux, Maximilien Gadouleau, Guillaume Theyssier
Automata networks are mappings of the form f : Q Z Q Z , where Q is a finite alphabet and Z is a set of entities; they generalise Cellular Automata and Boolean networ…
On simulation in automata networks
Florian Bridoux, Maximilien Gadouleau, Guillaume Theyssier
An automata network is a finite graph where each node holds a state from some finite alphabet and is equipped with an update function that changes its state according to the config…