Teaching UGC NET Mock Test Series 2025 (Paper 1 & 2) Theory of Computation Regular Languages and Finite Automata Regular Languages
Consider the following languages over \(\Sigma\) = {0,1}
L = {0m1n|m=n; m,n>0}
R = {w \(\epsilon\) \(\Sigma^*\)| \(|w|_0\) = \(|w|_1\)} where \(|w|_0\) denotes number of 0's and \(|w|_1\)denotes number of 1's.
Which of the following is not a regular language?1
\(L \cup R\)
2
\(L \cap R\)
3
Both 1 and 2
4
None of the above