Question

Q given a non-deterministic finite automation (nfa) with states p and r as initial and final states respectively and transition table as given below: a b p q q r s r r s s r s the minimum number of states required in deterministic finite automation (dfa) equivalent to nfa is (net-june-2013) (a) 5 (b) 4 (c) 3 (d) 2

Answer 1

Answer:

5

Explanation:

all so ifdjcjcc Pao kfkgkfcncnvnkgkgigkg bhj