Let Σ = {0,1}, L = Σ* and R = {0ⁿ1ⁿ such that n > 0} then the languages L ∪ R…

PYQ GATE 1995

Let Σ = {0,1}, L = Σ* and R = {0ⁿ1ⁿ such that n > 0} then the languages L ∪ R and R are respectively

  1. A.

    regular, regular

  2. B.

    not regular, regular

  3. C.

    regular, not regular

  4. D.

    not regular, no regular

Attempted by 70 students.

Sign up free to check your answer

Sign up free

Explore the full course: Theory Of Computation

Loading lesson…