scientific article; zbMATH DE number 1741013

MaRDI QIDQ4331197zbMATH OpenFDO

Authors Christopher L. Barrett, S. S. Ravi, R. E. Stearns, Predrag T. Tosic, H. B. III Hunt, Madhav V. Marathe, Daniel J. Rosenkrantz

Publication date 10 June 2002

Full work available at URL http://www.emis.de/journals/DMTCS/proceedings/html/dmAA0106.abs.html

zbMATH Keywords

cellular automatacomputational complexitydiscrete dynamical systems

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• ON THE COMPLEXITY OF COUNTING FIXED POINTS AND GARDENS OF EDEN IN SEQUENTIAL DYNAMICAL SYSTEMS ON PLANAR BIPARTITE GRAPHS
• Predecessors existence problems and Gardens of Eden in sequential dynamical systems
• On some special classes of sequential dynamical systems
• Elements of a theory of simulation. III: Equivalence of SDS.
• ETS IV: Sequential dynamical systems: fixed points, invertibility and equivalence

Cited in

(29)

• 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
• ETS IV: Sequential dynamical systems: fixed points, invertibility and equivalence
• Solution to the predecessors and gardens-of-Eden problems for synchronous systems over directed graphs
• Enumerating periodic orbits in sequential dynamical systems over graphs
• Existence, coexistence and uniqueness of fixed points in parallel and sequential dynamical systems over directed graphs
• Dichotomy results for fixed point counting in Boolean dynamical systems
• Dynamical attraction in parallel network models
• On periods and equilibria of computational sequential systems
• Predecessors existence problems and Gardens of Eden in sequential dynamical systems
• Inferring local transition functions of discrete dynamical systems from observations of system behavior
• Computational complexity studies of synchronous Boolean finite dynamical systems on directed graphs
• Predecessor existence problems for finite discrete dynamical systems
• Predecessors and Gardens of Eden in sequential dynamical systems over directed graphs
• Complexity of inferring local transition functions of discrete dynamical systems
• Computational complexity studies of synchronous Boolean finite dynamical systems
• scientific article; zbMATH DE number 2128182 (Why is no real title available?)
• The predecessor-existence problem for \(k\)-reversible processes
• Attractors and transient in sequential dynamical systems
• 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
• Unconventional Computation
• ON THE COMPLEXITY OF COUNTING FIXED POINTS AND GARDENS OF EDEN IN SEQUENTIAL DYNAMICAL SYSTEMS ON PLANAR BIPARTITE GRAPHS
• Synchronous Boolean finite dynamical systems on directed graphs over XOR functions
• Period-3 orbits of sequential dynamical systems and their relationship to error-correcting codes over finite fields
• Multi-state sequential Boolean networks: an analysis of its combinatorial dynamics
• Flexible toggles and symmetric invertible asynchronous elementary cellular automata
• Complexity of reachability problems for finite discrete dynamical systems

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4331197)