MadeEasy Advance Level Test: Theory of Computation - Finite Automata

Question

Answer given is 2,but shouldn't it be 3? State itself will be there in e-closure?

Comments

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

---

3....

---

Duplicate: https://gateoverflow.in/174954/madeeasy-advance-level-theory-computation-finite-automata

Answer 1

ε closure of any state means with the help of ε (0 length)  from that state ,how many new state we can reach.

To find ε closure, the state is itself in it's closure.

In given question (p,a)= {a,r}, which is undefined(printing mistake) here because a is not any state, a is input here.

ε closurer(p)= {p,q,r}

so 3 state present.

Answer 2

plz refer here: https://gateoverflow.in/174954/toc-made-easy-advance-level-test

Answer 3

Answer should be epsilon closure(P)= {p,q,r}

Answer 4

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}.