On periods and equilibria of computational sequential systems
From MaRDI portal
Publication:2293262
DOI10.1016/j.ins.2017.05.002zbMath1429.68167OpenAlexW2614025017MaRDI QIDQ2293262
Juan A. Aledo, Luis G. Diaz, Silvia Martinez, J. C. Valverde Fajardo
Publication date: 7 February 2020
Published in: Information Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ins.2017.05.002
Graph theory (including graph drawing) in computer science (68R10) Dynamical aspects of cellular automata (37B15) Combinatorial dynamics (types of periodic orbits) (37E15) Networks and circuits as models of computation; circuit complexity (68Q06)
Related Items (21)
Notions from rough set theory in a generalized dependency relation context ⋮ Rough sets on graphs: New dependency and accuracy measures ⋮ Locally finite complexes, modules and generalized information systems ⋮ Fixed points in generalized parallel and sequential dynamical systems induced by a minterm or maxterm Boolean functions ⋮ Granular computing on information tables: families of subsets and operators ⋮ Predecessors and Gardens of Eden in sequential dynamical systems over directed graphs ⋮ Maximum number of periodic orbits in parallel dynamical systems ⋮ Counting periodic points in parallel graph dynamical systems ⋮ Pairings and related symmetry notions ⋮ Existence, coexistence and uniqueness of fixed points in parallel and sequential dynamical systems over directed graphs ⋮ Predecessors and Garden-of-Eden configurations in parallel dynamical systems on maxterm and minterm Boolean functions ⋮ New perspectives of granular computing in relation geometry induced by pairings ⋮ Solution to the predecessors and gardens-of-Eden problems for synchronous systems over directed graphs ⋮ Dynamical attraction in parallel network models ⋮ Periods in XOR parallel dynamical systems over directed dependency graphs ⋮ Set relations and set systems induced by some families of integral domains ⋮ Enumerating periodic orbits in sequential dynamical systems over graphs ⋮ Predecessors existence problems and Gardens of Eden in sequential dynamical systems ⋮ Some classifications of graphs with respect to a set adjacency relation ⋮ Granular computing on basic digraphs ⋮ Attractors and transient in sequential dynamical systems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A new discrete dynamical system of signed integer partitions
- Parallel discrete dynamical systems on independent local functions
- Limit cycle structure for dynamic bi-threshold systems
- 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
- 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
- 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
- Maximum number of fixed points in AND-OR-NOT networks
- On the computation of fixed points in Boolean networks
- Statistical mechanics of cellular automata
- Complex Network Theory and Its Application Research on P2P Networks
- Unconventional Computation
This page was built for publication: On periods and equilibria of computational sequential systems
