Synchronous Boolean Finite Dynamical Systems on Directed Graphs over XOR Functions
From MaRDI portal
Recommendations
- Synchronous Boolean finite dynamical systems on directed graphs over XOR functions
- Computational complexity studies of synchronous Boolean finite dynamical systems on directed graphs
- Computational complexity studies of synchronous Boolean finite dynamical systems
- Periods in XOR parallel dynamical systems over directed dependency graphs
- Discrete dynamical systems on graphs and Boolean functions
- Synchronization of Boolean dynamical systems: a spectral characterization
- scientific article; zbMATH DE number 1136663
- Boolean networks synchronism sensitivity and XOR circulant networks convergence time
- Synchronizing Boolean networks asynchronously
- Parallel discrete dynamical systems on maxterm and minterm Boolean functions
Cites work
- An introduction to the theory of numbers. Edited and revised by D. R. Heath-Brown and J. H. Silverman. With a foreword by Andrew Wiles
- Complexity of reachability problems for finite discrete dynamical systems
- Computational complexity studies of synchronous Boolean finite dynamical systems on directed graphs
- Dichotomy results for fixed-point existence problems for Boolean dynamical systems
- Elements of a theory of simulation. II: Sequential dynamical systems.
- Generalized predecessor existence problems for Boolean finite dynamical systems on directed graphs
- scientific article; zbMATH DE number 1741013 (Why is no real title available?)
- scientific article; zbMATH DE number 2046041 (Why is no real title available?)
- Predecessor existence problems for finite discrete dynamical systems
- Reachability problems for sequential dynamical systems with threshold functions.
Cited in
(3)
This page was built for publication: Synchronous Boolean Finite Dynamical Systems on Directed Graphs over XOR Functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5089250)
