Enumerating periodic orbits in sequential dynamical systems over graphs
From MaRDI portal
Publication:2068626
DOI10.1016/j.cam.2020.113084zbMath1489.37051OpenAlexW3038714426MaRDI QIDQ2068626
Silvia Martinez, Luis G. Diaz, Juan A. Aledo, J. C. Valverde Fajardo
Publication date: 20 January 2022
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cam.2020.113084
Permutations, words, matrices (05A05) Enumeration in graph theory (05C30) Combinatorial dynamics (types of periodic orbits) (37E15) Dynamical systems involving maps of trees and graphs (37E25)
Related Items (1)
Cites Work
- 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
- Limit cycle structure for dynamic bi-threshold systems
- Dynamics groups of asynchronous cellular automata
- On the use of cellular automata in symmetric cryptography
- Cellular automata as a paradigm for ecological modeling
- Cellular automata model for the diffusion equation
- Elements of a theory of computer simulation. I
- Reachability problems for sequential dynamical systems with threshold functions.
- Decomposition and simulation of sequential dynamical systems
- Elements of a theory of simulation. II: Sequential dynamical systems.
- On acyclic orientations and sequential dynamical systems
- 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
- Elements of a theory of simulation. III: Equivalence of SDS.
- ETS IV: Sequential dynamical systems: fixed points, invertibility and equivalence
- Discrete dynamical systems on graphs and Boolean functions
- 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
- Emulating cellular automata in chemical reaction-diffusion networks
- Predecessors existence problems and Gardens of Eden in sequential dynamical systems
- Parallel dynamical systems over graphs and related topics: a survey
- A graph-dynamical interpretation of Kiselman's semigroups
- Parallel dynamical systems over directed dependency graphs
- Update schedules of sequential 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
- Unconventional Computation
- ON THE COMPLEXITY OF COUNTING FIXED POINTS AND GARDENS OF EDEN IN SEQUENTIAL DYNAMICAL SYSTEMS ON PLANAR BIPARTITE GRAPHS
- Linear Finite Dynamical Systems
- Automata, Languages and Programming
- Sequential dynamical systems over words
This page was built for publication: Enumerating periodic orbits in sequential dynamical systems over graphs