Errata for the paper ``Predecessor existence problems for finite discrete dynamical systems.

DOI10.1016/J.TCS.2007.11.001zbMath1138.68426OpenAlexW1974536480MaRDI QIDQ924687

Richard E. Stearns, Daniel J. Rosenkrantz, Harry B. III Hunt, Mayur Thakur, Madhav V. Marathe, S. S. Ravi, Chris L. Barrett

Publication date: 19 May 2008

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2007.11.001

zbMATH Keywords

computational complexitycellular automatadiscrete dynamical systemsdata flow analysispredecessor existencesoftware and hardware verification

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Specification and verification (program logics, model checking, etc.) (68Q60) Cellular automata (computational aspects) (68Q80) Dynamical aspects of cellular automata (37B15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (2)

Solution to the predecessors and gardens-of-Eden problems for synchronous systems over directed graphs ⋮ Predecessors existence problems and Gardens of Eden in sequential dynamical systems

Cites Work

• A simplified NP-complete satisfiability problem
• The Complexity of Planar Counting Problems

This page was built for publication: Errata for the paper ``Predecessor existence problems for finite discrete dynamical systems.