Predecessors Existence Problems and Gardens of Eden in Sequential Dynamical Systems
Juan A. Aledo, Luis G. Diaz, Sílvia Martínez, José C. Valverde · Complexity · 2019
In this paper, we deal with one of the main computational questions in network models: the predecessor‐existence problems. In particular, we solve algebraically such problems in sequential dynamical systems on maxterm and minterm Boolean functions. We also provide a description of the Garden‐of‐Eden configurations of any system, giving the best upper bound for the number of Garden‐of‐Eden points.