In this work, we provide conditions to obtain fixed point theorems for parallel dynamical systems over graphs with (Boolean) maxterms and minterms as global evolution operators. In order to do that, we previously prove that periodic orbits of different periods cannot coexist, which implies that Sharkovsky’s order is not valid for this kind of dynamical systems.
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.
In this work, we deal with the predecessors existence problems in sequential dynamical systems over directed graphs. The results given in this paper extend those existing for such systems over undirected graphs. In particular, we solve the problems on the existence, uniqueness and coexistence of predecessors of any given state vector, characterizing the Garden-of-Eden states at the same time. We are also able to provide a bound for the number of predecessors and Garden-of-Eden state vectors of any of these systems.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.