Teaching HPSC Lecturer (Technical) Mock Test 2024 Theory of Computation Regular Languages and Finite Automata Finite Automata
Which of the following \(\epsilon-NFA\) , are equivalent?
I)
II)
III)
1
I and II only
2
II and III only
3
I, II and III only
4
None of the above
5
Question Not Attempted