On Simulation in Automata Networks

  title={On Simulation in Automata Networks},
  author={Florian Bridoux and Maximilien Gadouleau and Guillaume Theyssier},
  journal={Beyond the Horizon of Computability},
  pages={277 - 288}
An automata network is a finite graph where each node holds a state from some finite alphabet and is equipped with an update function that changes its state according to the configuration of neighboring states. More concisely, it is given by a finite map \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$f:Q^n… Expand
1 Citations
Beyond the Horizon of Computability: 16th Conference on Computability in Europe, CiE 2020, Fisciano, Italy, June 29–July 3, 2020, Proceedings
Read Mapping Through Hardware/Software Co-design Through hardware/ software co-design is explored through hardware-based and software-based approaches. Expand


Complete simulation of automata networks
The concept of complete simulation in the context of semigroups of transformations of A^n, also known as finite state-homogeneous automata networks, is studied to illustrate the strengths and weaknesses of parallel models of computation, such as cellular automata. Expand
Simple dynamics on graphs
It is proved that for every signed digraph $G$ there exists a system that converges toward a unique fixed point in at most $\lfloor\log_2 n\rfloor+2$ steps. Expand
Cellular Graph Automata. I. Basic Concepts, Graph Property Measurement, Closure Properties
This paper discusses how a class of generalized cellular automata in which the intercell connections define a graph of bounded degree can measure various properties of its underlying graph, including the radius and the number of nodes, in time proportional to the diameter. Expand
Computation on binary tree-networks
  • M. Tchuente
  • Mathematics, Computer Science
  • Discret. Appl. Math.
  • 1986
Abstract In this paper, we show that, for any finite set X, the set A(Xn) of mappings from Xn into itself is computable on a network N=(G, X) of size n, if and only if N contains an automaton whichExpand
Mapping Computation with No Memory
The in situ trait of the programs constructed here applies to optimization of program and chip design with respect to the number of variables, since no extra writing memory is used. Expand
Cellular Graph Automata
  • A. Wu, A. Rosenfeld
  • Computer Science
  • Graph-Grammars and Their Application to Computer Science and Biology
  • 1978
It can be shown that a cellular d-graph automaton can measure various properties of its underlying graph; can detect graph or subgraph isomorphism; and can recognize various basic types of graphs. Expand
Cellular Graph Automata. II. Graph and Subgraph Isomorphism, Graph Structure Recognition
Diameter-time algorithms are presented for the detection of graph or subgraph isomorphism in time proportional to the diameter of the given graph and types of graph structures that can be recognized by these automata are examined. Expand
PSPACE-completeness of majority automata networks
This work shows that the complexity of the problem of predicting an eventual state change in some vertex, given an initial configuration, is PSPACE-complete. Expand
On the influence of the interaction graph on a finite dynamical system
  • M. Gadouleau
  • Computer Science, Mathematics
  • Natural Computing
  • 2019
It is shown that the minimum rank decreases with the alphabet size, thus yielding the definition of an absolute minimum rank, and lower and upper bounds on thisabsolute minimum rank are obtained. Expand
Synchronism versus asynchronism in monotonic Boolean automata networks
This paper focuses on Boolean automata networks and the updatings of automata states in these networks and study how synchronous updates impact on the global behaviour of a network. Expand