# On Simulation in Automata Networks

@article{Bridoux2020OnSI,
title={On Simulation in Automata Networks},
author={Florian Bridoux and Maximilien Gadouleau and Guillaume Theyssier},
journal={Beyond the Horizon of Computability},
year={2020},
volume={12098},
pages={277 - 288}
}
• Published 2020
• Computer Science, Mathematics
• Beyond the Horizon of Computability
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

#### Figures and Topics from this paper

Beyond the Horizon of Computability: 16th Conference on Computability in Europe, CiE 2020, Fisciano, Italy, June 29–July 3, 2020, Proceedings
• Computer Science
• CiE
• 2020
Read Mapping Through Hardware/Software Co-design Through hardware/ software co-design is explored through hardware-based and software-based approaches. Expand

#### References

SHOWING 1-10 OF 32 REFERENCES
Complete simulation of automata networks
• Computer Science
• J. Comput. Syst. Sci.
• 2020
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
• Mathematics, Computer Science
• Theor. Comput. Sci.
• 2016
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
• Computer Science
• Inf. Control.
• 1979
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
• Computer Science
• UC
• 2009
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
• 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
• Computer Science, Mathematics
• Inf. Control.
• 1979
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
• Computer Science, Mathematics
• Theor. Comput. Sci.
• 2016
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