Abstract. We study computational complexity of counting the fixed point configurations (FPs) in certain classes of graph automata viewed as discrete dynamical systems. We prove t...
The rules of "Bulgarian solitaire" are considered as an operation on the set of partitions to induce a finite dynamical system. We focus on partitions with no preimage u...