0
$\begingroup$

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.

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

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Browse other questions tagged or ask your own question.