On periods and equilibria of computational sequential systems
From MaRDI portal
Publication:2293262
DOI10.1016/J.INS.2017.05.002zbMATH Open1429.68167OpenAlexW2614025017MaRDI QIDQ2293262FDOQ2293262
Authors: Juan A. Aledo, Luis Guillermo Díaz, S. Martinez, Jose C. Valverde 
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
Recommendations
- Enumerating periodic orbits in sequential dynamical systems over graphs
- On the periods of parallel dynamical systems
- Maximum number of periodic orbits in parallel dynamical systems
- Existence, coexistence and uniqueness of fixed points in parallel and sequential dynamical systems over directed graphs
- Attractors and transient in sequential dynamical systems
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)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Elements of a theory of computer simulation. I
- Elements of a theory of simulation. II: 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
- A new discrete dynamical system of signed integer partitions
- Statistical mechanics of cellular automata
- Title not available (Why is that?)
- Cellular automata model for the diffusion equation
- Cellular automata as a paradigm for ecological modeling
- Parallel discrete dynamical systems on independent local functions
- Title not available (Why is that?)
- Limit cycle structure for dynamic bi-threshold systems
- Unconventional Computation
- On acyclic orientations and sequential dynamical systems
- On the computation of fixed points in Boolean networks
- On the use of cellular automata in symmetric cryptography
- Maximum number of fixed points in AND-OR-NOT networks
- Complex network theory and its application research on P2P networks
Cited In (24)
- Counting periodic points in parallel graph dynamical systems
- Dynamical attraction in parallel network models
- Predecessors existence problems and Gardens of Eden in sequential dynamical systems
- Computing and Combinatorics
- Locally finite complexes, modules and generalized information systems
- New perspectives of granular computing in relation geometry induced by pairings
- Some classifications of graphs with respect to a set adjacency relation
- Fixed points in generalized parallel and sequential dynamical systems induced by a minterm or maxterm Boolean functions
- Solution to the predecessors and gardens-of-Eden problems for synchronous systems over directed graphs
- Absence of periodic orbits in digital memcomputing machines with solutions
- Set relations and set systems induced by some families of integral domains
- Maximum number of periodic orbits in parallel dynamical systems
- 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
- Notions from rough set theory in a generalized dependency relation context
- Pairings and related symmetry notions
- Granular computing on basic digraphs
- Granular computing on information tables: families of subsets and operators
- Periods in XOR parallel dynamical systems over directed dependency graphs
- Update schedules of sequential dynamical systems
- Enumerating periodic orbits in sequential dynamical systems over graphs
- Attractors and transient in sequential dynamical systems
- Predecessors and Gardens of Eden in sequential dynamical systems over directed graphs
- Rough sets on graphs: new dependency and accuracy measures
This page was built for publication: On periods and equilibria of computational sequential systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2293262)
