Predecessors Existence Problems and Gardens of Eden in Sequential Dynamical Systems-Reference-Cited by-同舟云学术

Predecessors Existence Problems and Gardens of Eden in Sequential Dynamical Systems

Published:2019-03-07 Issue: Volume:2019 Page:1-10
ISSN:1076-2787
Container-title:Complexity
language:en
Short-container-title:Complexity

Author:

Aledo Juan A.¹²^ORCID,Diaz Luis G.¹²^ORCID,Martinez Silvia¹²^ORCID,Valverde Jose C.¹²^ORCID

Affiliation:

1. Institute of Applied Mathematics in Science and Engineering, Ciudad Real, Spain

2. Department of Mathematics, University of Castilla-La Mancha, Albacete, Spain

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.

Funder

Junta de Comunidades de Castilla-La Mancha

Publisher

Hindawi Limited

Subject

Multidisciplinary,General Computer Science

Link

http://downloads.hindawi.com/journals/complexity/2019/6280960.pdf

Reference43 articles.

1. A class of lattices and boolean functions related to the Manickam–Miklös–Singhi conjecture

2. Parallel and sequential dynamics of two discrete models of signed integer partitions

3. Lecture Notes in Computer Science,2014

4. A new discrete dynamical system of signed integer partitions

Cited by 2 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Enumerating periodic orbits in sequential dynamical systems over graphs;Journal of Computational and Applied Mathematics;2022-05

2. Attractors and transient in sequential dynamical systems;International Journal of Computer Mathematics;2019-08-05