# Epsilon Nfa

547 views

What would be the |epsilon closure (p)|=?

0
Ithink ans should be 3 (p,q,r) but the given ans. is 2 (q,r)
0
3....

Answer should be epsilon closure(P)= {p,q,r}
Epsilon closure is a set of states that a particular automata state can reach only on the transition of 'epsilon' and nothing else and also a state by default has a transition on to itself on epsilon input and given that further P is going to q and r therefore answer is 3

P={ P,Q,R}.

## Related questions

1 vote
1
125 views
If a DFA "D" have symbol {0,1,2} and NFA "N" have symbol {0,1} but both are representing strings ending with 01 and whole string only contain {0,1} then can we say L(N) = L(D) i.e language represented by DFA is equal to language represented by NFA?
Let l={ (ap )* | p is a prime number} and $\sum$={a}.The minimum number of states in NFA which can accept this language. This is a question from a test series,I just want to know if the question is valid as I feel raised to prime number will not be regular,correct me if I am wrong.Not asking for solution to the question but if the question is valid.