Commutative automata networks

DOI10.1007/978-3-030-61588-8_4MaRDI QIDQ6339120arXivFDO

Authors Florian Bridoux, Maximilien Gadouleau, Guillaume Theyssier

Publication date 21 April 2020

Published in arXiv

Full work available at URL https://doi.org/10.1007/978-3-030-61588-8_4

Mathematics Subject Classification ID

Symbolic dynamics (37B10) Networks and circuits as models of computation; circuit complexity (68Q06) Formal languages and automata (68Q45) Cellular automata (computational aspects) (68Q80)

arXiv classification

cs.CCcs.DMmath.DS

Abstract: Automata networks are mappings of the form f : Q Z $ightarrow$ 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 fi : Q Z $ightarrow$ 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, locally commutative and globally commu-tative networks. We investigate the relation between commutativity and different forms of locality of update functions; one main conclusion is that globally commutative networks have strong dynamical properties, while locally commutative networks are much less constrained. We also give a complete classification of all globally commutative Boolean networks.

This page was built for publication: Commutative automata networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6339120)