Predecessors and Gardens of Eden in sequential dynamical systems over directed graphs

DOI10.2478/AMNS.2018.2.00046OpenAlexW2920844284MaRDI QIDQ2690627

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

Publication date: 17 March 2023

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

Full work available at URL: https://doi.org/10.2478/amns.2018.2.00046

zbMATH Keywords

Boolean functionssequential dynamical systemspredecessorsGarden-of-Eden points

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Deterministic network models in operations research (90B10) Combinatorial dynamics (types of periodic orbits) (37E15)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Parallel discrete dynamical systems on independent local functions
• An introduction to sequential dynamical systems
• Graph Turing machines
• Generalized predecessor existence problems for Boolean finite dynamical systems on directed graphs
• Predecessors and Garden-of-Eden configurations in parallel dynamical systems on maxterm and minterm Boolean functions
• Matrix method for linear sequential dynamical systems on digraphs
• Discrete, sequential dynamical systems
• On the computational complexity of finite cellular automata
• Parallel discrete dynamical systems on maxterm and minterm Boolean functions
• Solution to the predecessors and gardens-of-Eden problems for synchronous systems over directed graphs
• On the periods of parallel dynamical systems
• Maximum number of periodic orbits in parallel dynamical systems
• On periods and equilibria of computational sequential systems
• Predecessors existence problems and Gardens of Eden in sequential dynamical systems
• Parallel dynamical systems over graphs and related topics: a survey
• Computational complexity studies of synchronous Boolean finite dynamical systems on directed graphs
• Parallel dynamical systems over directed dependency graphs
• Predecessor existence problems for finite discrete dynamical systems
• Computational Complexity Studies of Synchronous Boolean Finite Dynamical Systems
• Binary Codes and Period-2 Orbits of Sequential Dynamical Systems
• Generalized Predecessor Existence Problems for Boolean Finite Dynamical Systems
• Updating method for the computation of orbits in parallel and sequential dynamical systems

This page was built for publication: Predecessors and Gardens of Eden in sequential dynamical systems over directed graphs