16 citations · 46 across the 31 of their papers we have counts for
3 papers · 1 filter
On the impact of treewidth in the computational complexity of freezing dynamics
Eric Goles, Pedro Montealegre, Martín Ríos-Wilson +1
An automata network is a network of entities, each holding a state from a finite set and evolving according to a local update rule which depends only on its neighbors in the networ…
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…