scientific article
From MaRDI portal
Publication:3793734
zbMath0648.68067MaRDI QIDQ3793734
Publication date: 1987
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Cellular automata (computational aspects) (68Q80)
Related Items (15)
Complexity of reachability problems for finite discrete dynamical systems ⋮ Progress, gaps and obstacles in the classification of cellular automata ⋮ Complexity of Inferring Local Transition Functions of Discrete Dynamical Systems ⋮ Reachability problems for sequential dynamical systems with threshold functions. ⋮ Predecessors and Gardens of Eden in sequential dynamical systems over directed graphs ⋮ Predecessor existence problems for finite discrete dynamical systems ⋮ The reachability problem for finite cellular automata ⋮ Predecessors and Garden-of-Eden configurations in parallel dynamical systems on maxterm and minterm Boolean functions ⋮ Dichotomy results for fixed point counting in Boolean dynamical systems ⋮ Solution to the predecessors and gardens-of-Eden problems for synchronous systems over directed graphs ⋮ Modeling and analyzing social network dynamics using stochastic discrete graphical dynamical systems ⋮ Dynamical attraction in parallel network models ⋮ Computation theoretic aspects of cellular automata ⋮ On the impact of treewidth in the computational complexity of freezing dynamics ⋮ Inferring local transition functions of discrete dynamical systems from observations of system behavior
This page was built for publication:
