Teaching HPSC Lecturer (Technical) Mock Test 2024 Theory of Computation Regular Languages and Finite Automata Regular Languages
Which of the following represents the language corresponding to the regular expression r =(aa)* (bb)* b ?
1
L(r) = {a2nb2m+1 : n ≥ 1, m ≥ 1}
2
L(r) = {a2nb2m : n ≥ 0, m ≥ 0}
3
L(r) = {a2nb2m n ≥ 1, m ≥ 1}
4
L(r) = {a2nb2m+1 : n ≥ 0, m ≥ 0}
5
Question Not Attempted