Which of the following regular expressions denotes a language comprising of…
GSET 2022
Which of the following regular expressions denotes a language comprising of all possible strings over Σ = {a, b} of length n, where n is a multiple of 3 ?
- A.
(a + b + aa + bb + aba + bba)^*
- B.
(aaa + bbb)^*
- C.
((a + b) (a + b) (a + b))^*
- D.
(aaa + ab + a) + (bbb + bb + a)
Attempted by 9 students.
Sign up free to check your answer
Sign up freeLoading lesson…

