Expansive Automata Networks

@article{Bridoux2020ExpansiveAN,
  title={Expansive Automata Networks},
  author={Florian Bridoux and Maximilien Gadouleau and Guillaume Theyssier},
  journal={ArXiv},
  year={2020},
  volume={abs/1902.08007}
}
1 Citations

Intrinsic Simulations and Universality in Automata Networks

TLDR
A theory of intrinsic simulations and universality for families of automata networks is developed and a short proof that the family of networks were each node obeys the rule of the ’game of life’ cellular automaton is strongly universal is given.

References

SHOWING 1-10 OF 34 REFERENCES

Simple dynamics on graphs

Positive expansiveness versus network dimension in symbolic dynamical systems

On the Rank and Periodic Rank of Finite Dynamical Systems

  • M. Gadouleau
  • Mathematics, Computer Science
    Electron. J. Comb.
  • 2018
TLDR
The maximum rank and the maximum periodic rank of a finite dynamical system with a given interaction graph over any non-Boolean alphabet are determined and it is proved that the average rank is relatively close (as the size of the alphabet is large) to the maximum.

Cellular Graph Automata. I. Basic Concepts, Graph Property Measurement, Closure Properties

Observability of Boolean networks: A graph-theoretic approach

On the influence of the interaction graph on a finite dynamical system

  • M. Gadouleau
  • Mathematics, Computer Science
    Natural Computing
  • 2019
TLDR
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.

Cellular Graph Automata. II. Graph and Subgraph Isomorphism, Graph Structure Recognition

Cellular Graph Automata

  • A. WuA. Rosenfeld
  • Computer Science
    Graph-Grammars and Their Application to Computer Science and Biology
  • 1978
TLDR
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.

Dynamical properties of expansive one-sided cellular automata

To every one-sided one-dimensional cellular automatonF with neighbourhood radiusr we associate its canonical factor defined by considering only the firstr coordinates of all the images of points

On Dynamical Complexity of Surjective Ultimately Right-Expansive Cellular Automata

TLDR
It is shown that there exists a right-expansive reversible cellular automaton that has a non-sofic trace and thus does not have the pseudo-orbit tracing property.