# About number of NFSTs

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.

• What is the the output alphabet? There is no concept of "output alphabet" in the definition of a NFA. – Steven Jun 15 '20 at 16:20
• Sorry, i mean Non deterministic finite state transducers. – Hicham ATATRI Jun 15 '20 at 19:42