Let L = L1∩L2, where L1 and L2 are languages as defined below: L1 = {am bm can…

PYQ GATE 2009

Let L = L1∩L2, where L1 and L2 are languages as defined below:

L1 = {am bm can bn | m, n >= 0}

L2 = {ai bj ck | i, j, k >= 0}

Then L is

  1. A.

    Not recursive

  2. B.

    Regular

  3. C.

    Context free but not regular

  4. D.

    Recursively enumerable but not context free.

Attempted by 127 students.

Sign up free to check your answer

Sign up free

Explore the full course: Theory Of Computation

Loading lesson…