search
Log In
0 votes
547 views

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

in Theory of Computation 547 views
0
Ithink ans should be 3 (p,q,r) but the given ans. is 2 (q,r)
0
3....

3 Answers

0 votes
0 votes
Answer should be epsilon closure(P)= {p,q,r}
0 votes
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 answer
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?
asked Feb 20, 2019 in Theory of Computation Bhaskar Singh 125 views
0 votes
1 answer
2
0 votes
0 answers
3
102 views
Why is Regular grammar obtained from DFA always unambiguous? Why Regular grammar obtained from NFA may or may not be ambiguous?
asked Dec 7, 2018 in Theory of Computation OneZero 102 views
0 votes
0 answers
4
793 views
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.
asked Oct 16, 2018 in Theory of Computation sripo 793 views
...