Expansive automata networks

DOI10.1016/j.tcs.2020.06.019zbMath1460.68050arXiv1902.08007MaRDI QIDQ2003992

Florian Bridoux, Guillaume Theyssier, Maximilien Gadouleau

Publication date: 13 October 2020

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1902.08007

zbMATH Keywords

MDS codes; PSPACE-completeness; expansivity; automata networks

Mathematics Subject Classification ID

68Q45: Formal languages and automata

68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Simple dynamics on graphs
• Positive expansiveness versus network dimension in symbolic dynamical systems
• Orthogonal arrays. Theory and applications
• Dynamical properties of expansive one-sided cellular automata
• On dynamical complexity of surjective ultimately right-expansive cellular automata
• Theory of cellular automata: a survey
• On the rank and periodic rank of finite dynamical systems
• Observability of Boolean networks: a graph-theoretic approach
• Handbook of Finite Fields
• Cellular graph automata. I. basic concepts, graph property measurement, closure properties
• Cellular graph automata. II. graph and subgraph isomorphism, graph structure recognition
• Graph-Theoretical Constructions for Graph Entropy and Network Coding Based Communications
• Uniqueness Theorems for Periodic Functions
• Digraphs
• Systems of distinct representatives and linear algebra
• Expansive Subdynamics
• Nondegenerate 𝑞-biresolving textile systems and expansive automorphisms of onesided full shifts
• Unstable Homeomorphisms
• Orthogonal Arrays of Index Unity