13 citations · 26 across the 10 of their papers we have counts for
4 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'…
Complexity of the Freezing Majority Rule with L-shaped Neighborhoods
Pablo Concha-Vega, Eric Goles, Pedro Montealegre +1
In this article we investigate the computational complexity of predicting two dimensional freezing majority cellular automata with states , where the local interactions…
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 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…