engineering recuitment NIELIT Scientific Assistant Mock Test 2025 Theory of Computation Regular Languages and Finite Automata Finite Automata
Consider the following transition table of an NFA (q2 is final state)
|
δ |
0 |
1 |
|
→ q0 |
{q0, q1} |
{q0} |
|
q1 |
ϕ |
{q2} |
|
*q2 |
ϕ |
ϕ |
The language accepted by above NFA is:
1
{w|w ends with 01}
2
{w|w ends with 0}
3
{w|w ends with 1}
4
{w|w ends with 10}