Solution to the predecessors and gardens-of-Eden problems for synchronous systems over directed graphs

DOI10.1016/j.amc.2018.10.077zbMath1428.37042OpenAlexW2901680996MaRDI QIDQ2008486

Juan A. Aledo, Silvia Martinez, Luis G. Diaz, J. C. Valverde Fajardo

Publication date: 26 November 2019

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2018.10.077

zbMATH Keywords

Boolean functionsparallel dynamical systemspredecessorsgarden-of-Eden points

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Applications of graph theory (05C90) Cellular automata (computational aspects) (68Q80) Dynamical aspects of cellular automata (37B15) Combinatorial dynamics (types of periodic orbits) (37E15)

Related Items (7)

Real subset sums and posets with an involution ⋮ Alexandroff topologies and monoid actions ⋮ On a quotient \(S\)-set induced by countably infinite decreasing chains ⋮ Predecessors and Gardens of Eden in sequential dynamical systems over directed graphs ⋮ Lattice representations with set partitions induced by pairings ⋮ Enumerating periodic orbits in sequential dynamical systems over graphs ⋮ Predecessors existence problems and Gardens of Eden in sequential dynamical systems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A new discrete dynamical system of signed integer partitions
• Sand piles: from physics to cellular automata models
• Parallel discrete dynamical systems on independent local functions
• On the use of cellular automata in symmetric cryptography
• Errata for the paper ``Predecessor existence problems for finite discrete dynamical systems.
• Cellular automata as a paradigm for ecological modeling
• Cellular automata model for the diffusion equation
• Parallel and sequential dynamics of two discrete models of signed integer partitions
• Graph Turing machines
• Predecessors and Garden-of-Eden configurations in parallel dynamical systems on maxterm and minterm Boolean functions
• Discrete, sequential dynamical systems
• Discrete dynamical systems on graphs and Boolean functions
• On the computational complexity of finite cellular automata
• Parallel discrete dynamical systems on maxterm and minterm Boolean functions
• On the periods of parallel dynamical systems
• Maximum number of periodic orbits in parallel dynamical systems
• On periods and equilibria of computational sequential systems
• Emulating cellular automata in chemical reaction-diffusion networks
• Parallel dynamical systems over graphs and related topics: a survey
• Parallel dynamical systems over directed dependency graphs
• Predecessor existence problems for finite discrete dynamical systems
• Statistical mechanics of cellular automata
• Binary Codes and Period-2 Orbits of Sequential Dynamical Systems
• Complex Network Theory and Its Application Research on P2P Networks
• PAM
• Updating method for the computation of orbits in parallel and sequential dynamical systems

This page was built for publication: Solution to the predecessors and gardens-of-Eden problems for synchronous systems over directed graphs