1 citations · 2 across the 4 of their papers we have counts for
Showing cs.CCShow all
2 papers · 1 filter
cs.CC2025
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'…
cs.CC2025
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…