engineering recuitment NIELIT Scientific Assistant Mock Test 2025 Theory of Computation Regular Languages and Finite Automata Regular Languages
Consider the following languages:
(i) L = {wxwR | x, w ϵ {0, 1}*}
(ii) L = {x ϵ {0,1} | x is the binary encoding of an integer that is divisible by 99}
(iii) L = {1n0n0m | m + n > 100}
Which of the above languages is/are regular?
1
(i) only
2
(i) and (ii) only
3
(iii) only
4
All are regular