Can we proof the number of NFSTs with $$n$$ states : $$n.2^{mpn}.2^{n}$$ where $$p$$ is the cardinal of input alphabet and $$m$$ the cardinal of output alphabet.