The language L = { 0ⁱ 2 1ⁱ | i ≥ 0 } over the alphabet {0,1,2} is

PYQ GATE 2007

The language L = { 0ⁱ 2 1ⁱ | i ≥ 0 } over the alphabet {0,1,2} is

  1. A.

    not recursive

  2. B.

    is recursive and is a deterministic CFL

  3. C.

    is a regular language

  4. D.

    is not a deterministic CFL but a CFL

Attempted by 236 students.

Sign up free to check your answer

Sign up free

Explore the full course: Theory Of Computation

Loading lesson…