Synchronous Boolean Finite Dynamical Systems on Directed Graphs over XOR Functions

DOI10.4230/LIPIcs.MFCS.2020.76OpenAlexW3082859699MaRDI QIDQ5089250

Kei Uchizawa, Ogihara, Mitsunori

Publication date: 18 July 2022

Full work available at URL: https://doi.org/10.4230/LIPIcs.MFCS.2020.76

zbMATH Keywords

computational complexitydynamical systemsreachabilitypredecessorgarden of Eden

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Complexity of reachability problems for finite discrete dynamical systems
• Dichotomy results for fixed-point existence problems for Boolean dynamical systems
• Reachability problems for sequential dynamical systems with threshold functions.
• Elements of a theory of simulation. II: Sequential dynamical systems.
• Generalized predecessor existence problems for Boolean finite dynamical systems on directed graphs
• Computational complexity studies of synchronous Boolean finite dynamical systems on directed graphs
• Predecessor existence problems for finite discrete dynamical systems

This page was built for publication: Synchronous Boolean Finite Dynamical Systems on Directed Graphs over XOR Functions