In majority voting dynamics, a group of n agents in a social network are...
Our main result is a succinct counterpoint to Courcelle's meta-theorem a...
An automata network (AN) is a finite graph where each node holds a state...
This tutorial is about cellular automata that exhibit 'cold dynamics'. B...
This paper is about turedos, which are Turing machine whose head can mov...
This note is a survey of examples and results about cellular automata wi...
We study qualitative properties of two-dimensional freezing cellular aut...
An automata network (AN) is a finite graph where each node holds a state...
An automata network is a network of entities, each holding a state from ...
Automata networks are mappings of the form f : Q Z → Q Z , where
Q is a ...
An automata network is a finite graph where each node holds a state from...
An automata network is a finite graph where each node holds a state from...
This paper studies three classes of cellular automata from a computation...
An Automata Network is a map f:Q^n→ Q^n where Q is a finite
alphabet. It...
Cellular Automata have been used since their introduction as a discrete ...