Let Σ = {0,1}, L = Σ* and R = {0ⁿ1ⁿ such that n > 0} then the languages L ∪ R…
GATE · 1995 · CS · Question 2 subparts
Let Σ = {0,1}, L = Σ* and R = {0ⁿ1ⁿ such that n > 0} then the languages L ∪ R and R are respectively
- A.
regular, regular
- B.
not regular, regular
- C.
regular, not regular
- D.
not regular, no regular
Attempted by 5 students.
Sign up free to check your answer
Sign up freeLoading lesson…