Predecessors existence problems and Gardens of Eden in sequential dynamical systems (Q2325175): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1155/2019/6280960 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2920912432 / rank | |||
Normal rank | |||
Revision as of 22:39, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Predecessors existence problems and Gardens of Eden in sequential dynamical systems |
scientific article |
Statements
Predecessors existence problems and Gardens of Eden in sequential dynamical systems (English)
0 references
9 September 2019
0 references
Summary: 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.
0 references
