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...
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2019-01-01
|
| Series: | Complexity |
| Online Access: | http://dx.doi.org/10.1155/2019/6280960 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1832550907179433984 |
|---|---|
| author | Juan A. Aledo Luis G. Diaz Silvia Martinez Jose C. Valverde |
| author_facet | Juan A. Aledo Luis G. Diaz Silvia Martinez Jose C. Valverde |
| author_sort | Juan A. Aledo |
| collection | DOAJ |
| description | 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. |
| format | Article |
| id | doaj-art-5f1469cf9f1249bda01f0ad94a7b945b |
| institution | Kabale University |
| issn | 1076-2787 1099-0526 |
| language | English |
| publishDate | 2019-01-01 |
| publisher | Wiley |
| record_format | Article |
| series | Complexity |
| spelling | doaj-art-5f1469cf9f1249bda01f0ad94a7b945b2025-02-03T06:05:25ZengWileyComplexity1076-27871099-05262019-01-01201910.1155/2019/62809606280960Predecessors Existence Problems and Gardens of Eden in Sequential Dynamical SystemsJuan A. Aledo0Luis G. Diaz1Silvia Martinez2Jose C. Valverde3Institute of Applied Mathematics in Science and Engineering, Ciudad Real, SpainInstitute of Applied Mathematics in Science and Engineering, Ciudad Real, SpainInstitute of Applied Mathematics in Science and Engineering, Ciudad Real, SpainInstitute of Applied Mathematics in Science and Engineering, Ciudad Real, SpainIn 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.http://dx.doi.org/10.1155/2019/6280960 |
| spellingShingle | Juan A. Aledo Luis G. Diaz Silvia Martinez Jose C. Valverde Predecessors Existence Problems and Gardens of Eden in Sequential Dynamical Systems Complexity |
| title | Predecessors Existence Problems and Gardens of Eden in Sequential Dynamical Systems |
| title_full | Predecessors Existence Problems and Gardens of Eden in Sequential Dynamical Systems |
| title_fullStr | Predecessors Existence Problems and Gardens of Eden in Sequential Dynamical Systems |
| title_full_unstemmed | Predecessors Existence Problems and Gardens of Eden in Sequential Dynamical Systems |
| title_short | Predecessors Existence Problems and Gardens of Eden in Sequential Dynamical Systems |
| title_sort | predecessors existence problems and gardens of eden in sequential dynamical systems |
| url | http://dx.doi.org/10.1155/2019/6280960 |
| work_keys_str_mv | AT juanaaledo predecessorsexistenceproblemsandgardensofedeninsequentialdynamicalsystems AT luisgdiaz predecessorsexistenceproblemsandgardensofedeninsequentialdynamicalsystems AT silviamartinez predecessorsexistenceproblemsandgardensofedeninsequentialdynamicalsystems AT josecvalverde predecessorsexistenceproblemsandgardensofedeninsequentialdynamicalsystems |