Generalized Predecessor Existence Problems for Boolean Finite Dynamical Systems
From MaRDI portal
Publication:5111222
DOI10.4230/LIPICS.MFCS.2017.8zbMATH Open1441.68140OpenAlexW2774360669MaRDI QIDQ5111222FDOQ5111222
Kei Uchizawa, Akinori Kawachi, Ogihara, Mitsunori
Publication date: 26 May 2020
Full work available at URL: https://doi.org/10.4230/lipics.mfcs.2017.8
Analysis of algorithms and problem complexity (68Q25) Dynamical aspects of cellular automata (37B15) Cellular automata (computational aspects) (68Q80)
Cites Work
- Elements of a theory of simulation. II: Sequential dynamical systems.
- Nondeterministic Space is Closed under Complementation
- Title not available (Why is that?)
- Dichotomy results for fixed-point existence problems for Boolean dynamical systems
- Title not available (Why is that?)
- Complexity of reachability problems for finite discrete dynamical systems
- Computational Complexity Studies of Synchronous Boolean Finite Dynamical Systems
Cited In (7)
- On the dynamics of semilattice networks
- Fuzzy parallel dynamical systems on Zadeh operators
- Fixed points in generalized parallel and sequential dynamical systems induced by a minterm or maxterm Boolean functions
- Existence, coexistence and uniqueness of fixed points in parallel and sequential dynamical systems over directed graphs
- Dichotomy results for fixed-point existence problems for Boolean dynamical systems
- The predecessor-existence problem for \(k\)-reversible processes
- Predecessors and Gardens of Eden in sequential dynamical systems over directed graphs
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)
