Consider the following languages: L1 = { ww | w ∈ {a, b}* } L2 = { ww^R | w ∈…
GATE · Computer Science · 2001
Consider the following languages:
L1 = { ww | w ∈ {a, b}* }
L2 = { ww^R | w ∈ {a, b}+, w^R is the reverse of w }
L3 = { 0^(2i) | i is an integer }
L4 = { 0^(i^2) | i is an integer }
Which of the languages are regular?
- A.
Only L1 and L2
- B.
Only L2, L3 and L4
- C.
Only L3 and L4
- D.
Only L3
Attempted by 121 students.
Sign up free to check your answer
Sign up freeLoading lesson…