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

Abstract

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.

Keywords

• fixed point
• AND-OR dynamical system
• algorithmic complexity