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...

Full description

Saved in:
Bibliographic Details
Published in:Complexity (New York, N.Y.) Vol. 2019; no. 2019; pp. 1 - 10
Main Authors: Valverde, Jose C., Martinez, Silvia, Diaz, Luis G., Aledo, J.
Format: Journal Article
Language:English
Published: Cairo, Egypt Hindawi Publishing Corporation 01-01-2019
Hindawi
John Wiley & Sons, Inc
Hindawi Limited
Hindawi-Wiley
Subjects:
Algebra
Applied mathematics
Boolean algebra
Boolean functions
Combinatorics
Computer science
Dynamical systems
Information science
Mathematical models
Upper bounds
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
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.
ISSN:1076-2787
1099-0526
DOI:10.1155/2019/6280960