toc - doubt

Question

how (i) is true???

Comments

@pavan kumar dont u think that using "epsilon" would make it an "epsilon-NFA" and the statement is talking about "NFA"..

But in NFA it is possible that it accept extra string also except the string given in regular language so we have can an NFA with a single final state which accept the given regular language in addition to extra strings

---

@risabh yes it is only possible in epsilon-NFA otherwise it is not possible

---

@ pavan... yes i thought so...its an case of "epsilon NFA"

Answer 1

I. True, this is true, because using epsilon transition we can convert multiple final states into one.
II. True, both R.L and L.L can be convered to each other.
III. FALSE, Pumping Leema works negative way to prove a language nonregular.

Comments

You may be correct.

But then too the first stament remains true.

As Consider an NFA with the intial state as final state and having a self loop for all input symbols. This will accept everything. Literally evwrything, including epsilon.

Hope this helps :)

And bdw, epsilon NFA is a part pf NFA not anything different.

---

ok, thanks. That was gr8 one. :)

---

@Abbas actually epsilon nfa is superset of nfa, They are different and they have diffrent transition even though they have same powe but nfa can't be epsilon nfa and epsilon nfa can be converted to equivalent nfa. What about Ø does nfa accept it?(for 1 to be true)?