2 citations · 2 across the 11 of their papers we have counts for
5 papers · 1 filter
On the complexity of freezing automata networks of bounded pathwidth
Eric Goles, Pedro Montealegre, Martín Ríos-Wilson +1
An automata network is a graph 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 network'…
Intrinsic Simulations and Universality in Automata Networks
Martín Ríos-Wilson, Guillaume Theyssier
An automata network (AN) is a finite graph where each node holds a state from a finite alphabet and is equipped with a local map defining the evolution of the state of the node dep…
Generating Boolean Functions on Totalistic Automata Networks
Eric Goles, Andrew Adamatzky, Pedro Montealegre +1
We consider the problem of studying the simulation capabilities of the dynamics of arbitrary networks of finite states machines. In these models, each node of the network takes two…
On Symmetry versus Asynchronism: at the Edge of Universality in Automata Networks
Martín Ríos Wilson, Guillaume Theyssier
An automata network (AN) is a finite graph where each node holds a state from a finite alphabet and is equipped with a local map defining the evolution of the state of the node dep…
On the Complexity of Asynchronous Freezing Cellular Automata
Eric Goles, Diego Maldonado, Pedro Montealegre +1
In this paper we study the family of freezing cellular automata (FCA) in the context of asynchronous updating schemes. A cellular automaton is called freezing if there exists an or…