Predecessor existence problems for finite discrete dynamical systems
From MaRDI portal
Publication:2455591
cellular automatacomputational complexitydata flow analysisdiscrete dynamical systemspredecessor existencesoftware and hardware verification
Dynamical aspects of cellular automata (37B15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Analysis of algorithms and problem complexity (68Q25) Specification and verification (program logics, model checking, etc.) (68Q60) Cellular automata (computational aspects) (68Q80)
Recommendations
- Generalized predecessor existence problems for Boolean finite dynamical systems
- 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
- On the computational complexity of finite cellular automata
Cites work
- A computational algebra approach to the reverse engineering of gene regulatory networks
- Automata, Languages and Programming
- Cellular automata and the sciences of complexity. A review of some outstanding problems in the theory of cellular automata.
- Complexity classifications of Boolean constraint satisfaction problems
- Complexity of generalized satisfiability counting problems
- Decomposition and simulation of sequential dynamical systems
- Discrete, sequential dynamical systems
- Elements of a theory of simulation. III: Equivalence of SDS.
- Equivalence relations on finite dynamical systems
- Factor graphs and the sum-product algorithm
- General-Purpose Computation with Neural Networks: A Survey of Complexity Theoretic Results
- scientific article; zbMATH DE number 4201618 (Why is no real title available?)
- scientific article; zbMATH DE number 5504161 (Why is no real title available?)
- scientific article; zbMATH DE number 4058875 (Why is no real title available?)
- scientific article; zbMATH DE number 4070331 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1741013 (Why is no real title available?)
- scientific article; zbMATH DE number 2013795 (Why is no real title available?)
- scientific article; zbMATH DE number 2046041 (Why is no real title available?)
- scientific article; zbMATH DE number 1361465 (Why is no real title available?)
- scientific article; zbMATH DE number 4114031 (Why is no real title available?)
- scientific article; zbMATH DE number 2086606 (Why is no real title available?)
- scientific article; zbMATH DE number 2102770 (Why is no real title available?)
- scientific article; zbMATH DE number 816973 (Why is no real title available?)
- scientific article; zbMATH DE number 1405664 (Why is no real title available?)
- scientific article; zbMATH DE number 3328721 (Why is no real title available?)
- Inversion of 2D cellular automata: Some complexity results
- Limit, logic, and computation
- NP is as easy as detecting unique solutions
- On acyclic orientations and sequential dynamical systems
- ON THE COMPLEXITY OF COUNTING FIXED POINTS AND GARDENS OF EDEN IN SEQUENTIAL DYNAMICAL SYSTEMS ON PLANAR BIPARTITE GRAPHS
- On the complexity of verifying concurrent transition systems
- On the computational complexity of finite cellular automata
- On the Limit Sets of Cellular Automata
- On totalistic systolic networks
- One-way cellular automata on Cayley graphs
- Power indices and easier hard problems
- Proving liveness for networks of communicating finite state machines
- Reachability problems for sequential dynamical systems with threshold functions.
- SAT-Based Analysis of Cellular Automata
- Statistical mechanics of complex networks
- Strongly-local reductions and the complexity/efficient approximability of algebra and optimization on abstract algebraic structures
- The complexity of counting in sparse, regular, and planar graphs
- The Complexity of Enumeration and Reliability Problems
- The Complexity of Planar Counting Problems
- The complexity of satisfiability problems
- The Structure and Function of Complex Networks
- Unconventional Computation
- Which problems have strongly exponential complexity?
Cited in
(24)- On pre-periods of discrete influence systems
- Inhibiting diffusion of complex contagions in social networks: theoretical and experimental results
- Generalized predecessor existence problems for Boolean finite dynamical systems on directed graphs
- Predecessors and Garden-of-Eden configurations in parallel dynamical systems on maxterm and minterm Boolean functions
- Solution to the predecessors and gardens-of-Eden problems for synchronous systems over directed graphs
- Dynamical attraction in parallel network models
- Predecessors existence problems and Gardens of Eden in sequential dynamical systems
- Inferring local transition functions of discrete dynamical systems from observations of system behavior
- Predecessors and Gardens of Eden in sequential dynamical systems over directed graphs
- Complexity of inferring local transition functions of discrete dynamical systems
- Attractor stability in nonuniform Boolean networks
- The predecessor-existence problem for \(k\)-reversible processes
- Synchronous Boolean Finite Dynamical Systems on Directed Graphs over XOR Functions
- Generalized predecessor existence problems for Boolean finite dynamical systems
- Agent-based modeling, mathematical formalism for
- Dual P Systems
- Modeling and analyzing social network dynamics using stochastic discrete graphical dynamical systems
- Synchronous Boolean finite dynamical systems on directed graphs over XOR functions
- UNCERTAINTY VISUALIZATION FOR CHARACTERIZING HETEROGENEOUS HUMAN BEHAVIORS IN DISCRETE DYNAMICAL SYSTEM MODELS
- Counting fixed points and pure 2-cycles of tree cellular automata
- Counting on rainbow k-connections
- Theoretical foundations for parent divorcing transformations in Bayesian networks
- Synchronous dynamical systems on directed acyclic graphs: complexity and algorithms
- Reversing computation in membrane systems
This page was built for publication: Predecessor existence problems for finite discrete dynamical systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2455591)
