Predecessors Existence Problems and Gardens of Eden in Sequential Dynamical Systems
Joint Authors
Aledo, J.
Martinez, Silvia
Valverde, Jose C.
Diaz, Luis G.
Source
Issue
Vol. 2019, Issue 2019 (31 Dec. 2019), pp.1-10, 10 p.
Publisher
Hindawi Publishing Corporation
Publication Date
2019-03-07
Country of Publication
Egypt
No. of Pages
10
Main Subjects
Abstract EN
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.
American Psychological Association (APA)
Aledo, J.& Diaz, Luis G.& Martinez, Silvia& Valverde, Jose C.. 2019. Predecessors Existence Problems and Gardens of Eden in Sequential Dynamical Systems. Complexity،Vol. 2019, no. 2019, pp.1-10.
https://search.emarefa.net/detail/BIM-1132397
Modern Language Association (MLA)
Aledo, J.…[et al.]. Predecessors Existence Problems and Gardens of Eden in Sequential Dynamical Systems. Complexity No. 2019 (2019), pp.1-10.
https://search.emarefa.net/detail/BIM-1132397
American Medical Association (AMA)
Aledo, J.& Diaz, Luis G.& Martinez, Silvia& Valverde, Jose C.. Predecessors Existence Problems and Gardens of Eden in Sequential Dynamical Systems. Complexity. 2019. Vol. 2019, no. 2019, pp.1-10.
https://search.emarefa.net/detail/BIM-1132397
Data Type
Journal Articles
Language
English
Notes
Includes bibliographical references
Record ID
BIM-1132397
