On Complexity of Counting Fixed Points in Certain Classes of Graph Automata