Predecessors and Garden-of-Eden configurations in parallel dynamical systems on maxterm and minterm Boolean functions

DOI10.1016/j.cam.2018.08.015zbMath1404.37043OpenAlexW2888759610WikidataQ129341729 ScholiaQ129341729MaRDI QIDQ1757346

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

Publication date: 4 January 2019

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.2018.08.015

zbMATH Keywords

Boolean functionsparallel dynamical systemsgarden-of-Eden

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Combinatorial dynamics (types of periodic orbits) (37E15)

Related Items (11)

Alexandroff topologies and monoid actions ⋮ On a quotient \(S\)-set induced by countably infinite decreasing chains ⋮ Predecessors and Gardens of Eden in sequential dynamical systems over directed graphs ⋮ Solution to the predecessors and gardens-of-Eden problems for synchronous systems over directed graphs ⋮ Dynamical attraction in parallel network models ⋮ Lattice representations with set partitions induced by pairings ⋮ 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 ⋮ Attractors and transient in sequential dynamical systems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Parallel discrete dynamical systems on independent local functions
• On the use of cellular automata in symmetric cryptography
• Cellular automata as a paradigm for ecological modeling
• 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
• On the computational complexity of finite cellular automata
• Parallel discrete dynamical systems on maxterm and minterm Boolean functions
• On the periods of parallel dynamical systems
• On periods and equilibria of computational sequential systems
• Parallel dynamical systems over graphs and related topics: a survey
• Predecessor existence problems for finite discrete dynamical systems
• Statistical mechanics of cellular automata
• Complex Network Theory and Its Application Research on P2P Networks
• Cellular Automata Modeling of Physical Systems
• Automata, Languages and Programming

This page was built for publication: Predecessors and Garden-of-Eden configurations in parallel dynamical systems on maxterm and minterm Boolean functions