Predecessors Existence Problems and Gardens of Eden in Sequential Dynamical Systems

Juan A. Aledo, Luis G. Diaz, Silvia Martinez and Jose C. Valverde

Complexity, 2019, vol. 2019, 1-10

Abstract:

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.

Date: 2019
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/8503/2019/6280960.pdf (application/pdf)
http://downloads.hindawi.com/journals/8503/2019/6280960.xml (text/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:complx:6280960

DOI: 10.1155/2019/6280960

Access Statistics for this article

More articles in Complexity from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().