engineering recuitment NIELIT Scientific Assistant Mock Test 2025 Theory of Computation Regular Languages and Finite Automata
Study the following automaton:
What is the regular language accepted by the above automaton?
1
{03m 13n | m,n>=0}
2
{w | w has 111 as a substring}
3
{w has 3n 1's, n>=0}
4
{03m 13n | m,n>=1}