nfa to dfa

Question

Consider the following NFA for ∑={ g,a,t,e}.Find the number of states in equivalent minimal dfa.

a)4 

b)5

c)6

d)8

Comments

good :)

---

kindly send the result

---

AS I JUST DID IT IN ROUGH WORK SO I WILL TELL YOU PROCEDURE.

1 FIRST MAKE TABLE OF NFA

2 THEN CONVERT THAT TO DFA  ,3.THEN DFA TO  MINIMAL DFA.

YOU JUST TELL ME WHERE ARE YOU NOT GETTING THE CONCEPT ????

I WILL TRY TO FIX THAT

Answer 1

Total no. of states = 5

Comments

thanks

Answer 2

Its anwer is 5