scientific article; zbMATH DE number 2046041

MaRDI QIDQ4451017zbMATH OpenFDO

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

Publication date 22 February 2004

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

zbMATH Keywords

cellular automatacomputational complexitydiscrete dynamical systemspermutation existencepredecessor existence

Mathematics Subject Classification ID

Dynamical aspects of cellular automata (37B15) Cellular automata (computational aspects) (68Q80)

Recommendations

• Predecessors existence problems and Gardens of Eden in sequential dynamical systems
• Analysis problems for sequential dynamical systems and communicating state machines
• Elements of a theory of simulation. II: Sequential dynamical systems.
• On some special classes of sequential dynamical systems
• Sequential dynamical systems over words

Cited in

(15)

• 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
• Dichotomy results for fixed point counting in Boolean dynamical systems
• Dynamical attraction in parallel network models
• Predecessors existence problems and Gardens of Eden in sequential dynamical systems
• Predecessor existence problems for finite discrete dynamical systems
• Predecessors and Gardens of Eden in sequential dynamical systems over directed graphs
• The predecessor-existence problem for \(k\)-reversible processes
• Analysis problems for sequential dynamical systems and communicating state machines
• Attractors and transient in sequential dynamical systems
• Synchronous Boolean Finite Dynamical Systems on Directed Graphs over XOR Functions
• Modeling and analyzing social network dynamics using stochastic discrete graphical dynamical systems
• Synchronous Boolean finite dynamical systems on directed graphs over XOR functions
• 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 Q4451017)