engineering recuitment ISRO Scientist Computer Science Mock Test Theory of Computation Regular Languages and Finite Automata Finite Automata
Consider the following ϵ- NFA
What will be the set of reachable states on input 00?
1
{G, E, S, P}
2
{G, A, T, E, S, P}
3
{E, S}
4
{S, P, E, A, T}