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

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.

Podrobná bibliografie

Hlavní autoři:	Mauro Mezzini, Fernando L. Pelayo
Médium:	Artigo
Jazyk:	Inglês
Vydáno:	MDPI AG 2020-09-01
Edice:	Mathematics
Témata:	fixed point AND-OR dynamical system algorithmic complexity
On-line přístup:	https://www.mdpi.com/2227-7390/8/9/1611
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!