Solution to the predecessors and gardens-of-Eden problems for synchronous systems over directed graphs
DOI10.1016/J.AMC.2018.10.077zbMATH Open1428.37042OpenAlexW2901680996WikidataQ128985646 ScholiaQ128985646MaRDI QIDQ2008486FDOQ2008486
Juan A. Aledo, S. Martinez, Jose C. Valverde, Luis Guillermo Díaz
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
Applications of graph theory (05C90) Analysis of algorithms and problem complexity (68Q25) Dynamical aspects of cellular automata (37B15) Combinatorial dynamics (types of periodic orbits) (37E15) Cellular automata (computational aspects) (68Q80)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Parallel and sequential dynamics of two discrete models of signed integer partitions
- Discrete, sequential dynamical systems
- Discrete dynamical systems on graphs and Boolean functions
- Parallel discrete dynamical systems on maxterm and minterm Boolean functions
- Parallel dynamical systems over graphs and related topics: a survey
- Parallel dynamical systems over directed dependency graphs
- A new discrete dynamical system of signed integer partitions
- Statistical mechanics of cellular automata
- Sand piles: from physics to cellular automata models
- Cellular automata model for the diffusion equation
- Cellular automata as a paradigm for ecological modeling
- PAM
- Cellular automata. A discrete universe
- Parallel discrete dynamical systems on independent local functions
- On the computational complexity of finite cellular automata
- Predecessor existence problems for finite discrete dynamical systems
- Graph Turing machines
- On the use of cellular automata in symmetric cryptography
- Errata for the paper ``Predecessor existence problems for finite discrete dynamical systems.
- On the periods of parallel dynamical systems
- Emulating cellular automata in chemical reaction-diffusion networks
- On periods and equilibria of computational sequential systems
- Updating method for the computation of orbits in parallel and sequential dynamical systems
- Predecessors and Garden-of-Eden configurations in parallel dynamical systems on maxterm and minterm Boolean functions
- Complex Network Theory and Its Application Research on P2P Networks
- Maximum number of periodic orbits in parallel dynamical systems
- Binary Codes and Period-2 Orbits of Sequential Dynamical Systems
Cited In (8)
- Predecessors existence problems and Gardens of Eden in sequential dynamical systems
- On a quotient \(S\)-set induced by countably infinite decreasing chains
- Alexandroff topologies and monoid actions
- Representation theorems for simplicial complexes and matroidal-like properties of minimal partitioners
- Lattice representations with set partitions induced by pairings
- Enumerating periodic orbits in sequential dynamical systems over graphs
- Real subset sums and posets with an involution
- Predecessors and Gardens of Eden in sequential dynamical systems over directed graphs
This page was built for publication: Solution to the predecessors and gardens-of-Eden problems for synchronous systems over directed graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2008486)
