Teaching UGC NET Mock Test Series 2025 (Paper 1 & 2) Theory of Computation Regular Languages and Finite Automata Regular Languages
Which of the following languages are not regular?
A. L = {(01)n 0k | n > k, k >= 0}
B. L = {cn bk an + k | n >= 0, k >= 0}
C. L = {0n 1k | n ≠ k}
Choose the correct answer from the options given below :
1
A and B only
2
A and C only
3
B and C only
4
A, B and C