Generalized predecessor existence problems for Boolean finite dynamical systems
From MaRDI portal
Publication:5111222
Recommendations
- Generalized predecessor existence problems for Boolean finite dynamical systems on directed graphs
- Predecessors existence problems and Gardens of Eden in sequential dynamical systems
- Predecessors and Garden-of-Eden configurations in parallel dynamical systems on maxterm and minterm Boolean functions
- Computational complexity studies of synchronous Boolean finite dynamical systems
- Predecessor existence problems for finite discrete dynamical systems
Cites work
- scientific article; zbMATH DE number 4087055 (Why is no real title available?)
- scientific article; zbMATH DE number 1741013 (Why is no real title available?)
- Complexity of reachability problems for finite discrete dynamical systems
- Computational complexity studies of synchronous Boolean finite dynamical systems
- Dichotomy results for fixed-point existence problems for Boolean dynamical systems
- Elements of a theory of simulation. II: Sequential dynamical systems.
- Nondeterministic Space is Closed under Complementation
Cited in
(13)- Predecessor existence problems for finite discrete dynamical systems
- Generalized predecessor existence problems for Boolean finite dynamical systems on directed graphs
- Dichotomy results for fixed-point existence problems for Boolean dynamical systems
- Fixed points in generalized parallel and sequential dynamical systems induced by a minterm or maxterm Boolean functions
- Fuzzy parallel dynamical systems on Zadeh operators
- 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
- On the dynamics of semilattice networks
- Solution to the predecessors and gardens-of-Eden problems for synchronous systems over directed graphs
- Predecessors and Gardens of Eden in sequential dynamical systems over directed graphs
- Predecessors existence problems and Gardens of Eden in sequential dynamical systems
- Computational complexity studies of synchronous Boolean finite dynamical systems
- The predecessor-existence problem for \(k\)-reversible processes
This page was built for publication: Generalized predecessor existence problems for Boolean finite dynamical systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5111222)