Computational Complexity of Some Enumeration Problems About Uniformly Sparse Boolean Network Automata