Generalized Predecessor Existence Problems for Boolean Finite Dynamical Systems

DOI10.4230/LIPIcs.MFCS.2017.8zbMath1441.68140OpenAlexW2774360669MaRDI QIDQ5111222

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

zbMATH Keywords

computational complexitydynamical systemsGarden of Edenpredecessor

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Cellular automata (computational aspects) (68Q80) Dynamical aspects of cellular automata (37B15)

Related Items (5)

On the dynamics of semilattice networks ⋮ Fixed points in generalized parallel and sequential dynamical systems induced by a minterm or maxterm Boolean functions ⋮ Fuzzy parallel dynamical systems on Zadeh operators ⋮ Predecessors and Gardens of Eden in sequential dynamical systems over directed graphs ⋮ Existence, coexistence and uniqueness of fixed points in parallel and sequential dynamical systems over directed graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Complexity of reachability problems for finite discrete dynamical systems
• Dichotomy results for fixed-point existence problems for Boolean dynamical systems
• Elements of a theory of simulation. II: Sequential dynamical systems.
• Computational Complexity Studies of Synchronous Boolean Finite Dynamical Systems
• Nondeterministic Space is Closed under Complementation

This page was built for publication: Generalized Predecessor Existence Problems for Boolean Finite Dynamical Systems