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.
2012 ◽
Vol 09
(05)
◽
pp. 1250039
◽
Keyword(s):
2018 ◽
Vol 28
(04)
◽
pp. 1830011
Keyword(s):
2020 ◽
Vol 91
◽
pp. 105426
2012 ◽
Vol 204-208
◽
pp. 4776-4779
Keyword(s):