Abstract: Automata networks are mappings of the form \(f: Q^Z \rightarrow Q^Z\), where Q is a finite alphabet and Z is a set of entities; they generalise Cellular Automata and Boolean networks. An update schedule dictates when each entity updates its state according to its local function \(f_i: Q^Z \rightarrow Q\). One major question is to study the behaviour of a given automata networks under different update schedules. In this paper, we study automata networks that are invariant under many different update schedules. This gives rise to two definitions,...
(read more)
Topics: 
Discrete mathematics
Theoretical computer science