An Algorithm for Counting the Fixed Point Orbits of an AND-OR Dynamical System with Symmetric Positive Dependency Graph

Mathematics

Mauro Mezzini¹  FernandoL. Pelayo² 

[1] Department of Education, Roma Tre University, 00154 Roma, Italy;Escuela Superior de Ingenieria Informatica de Albacete, Computing Systems Department, University of Castilla-La Mancha, 02071 Albacete, Spain;

关键词: fixed point;    AND-OR dynamical system;    algorithmic complexity;   

DOI  :  10.3390/math8091611

来源: DOAJ

【 摘 要 】

In this paper we present an algorithm which counts the number of fixed point orbits of an AND-OR dynamical system. We further extend the algorithm in order to list all its fixed point orbits (FPOs) in polynomial time on the number of FPOs of the system.

【 授权许可】

Unknown