From: On optimal control policy for probabilistic Boolean network: a state reduction approach
Number of nonzero rows in BN
Number of BNs in all the (2n)nBNs
2n
n!2n
2(n-k)k = 1,2,...,(n - 1)
n ! C n n − k 2 n ∑ j = 1 k C n − k j ∑ ∑ i = 1 j A i = k + i A i > 2 , i = 1 , 2 , ... , j 1 A 1 ! ... A i !