GATE 2024 Theory of computation Foundation Quiz 84

Let L₁={aⁿ b^m∣n>m},L₂={aⁿ b^m∣n<m} and L₃={aⁿ b^m∣n=m}, then which of the following is true?

Which of the following is regular?

The total number of strings present in the below regular expression whose length less than 4 is _____.

(a+b)* b (a+bb)*

Which of the following statement is/are TRUE?

Consider the following languages:

L₁ = {0^{n + m} 1^{k + l} | m = l, m, n, k, l ≥ 1}

L₂ = {0ⁿ (1²)^m | m, n ≥ 0}

Which of the following is true?