Predecessors Existence Problems and Gardens of Eden in Sequential Dynamical Systems

Predecessors Existence Problems and Gardens of Eden in Sequential 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...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Complexity (New York, N.Y.) N.Y.), 2019-01, Vol.2019 (2019), p.1-10
Hauptverfasser: Valverde, Jose C., Martinez, Silvia, Diaz, Luis G., Aledo, J.
Format: Artikel
Sprache:eng
Schlagworte:
Algebra
Applied mathematics
Boolean algebra
Boolean functions
Combinatorics
Computer science
Dynamical systems
Information science
Mathematical models
Upper bounds
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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.
ISSN:1076-2787
1099-0526
DOI:10.1155/2019/6280960