Consider the following languages over the alphabet \(Σ = \{0,1,c\}\): \(L_1 =…

PYQ GATE 2014

Consider the following languages over the alphabet Σ={0,1,c}Σ = \{0,1,c\}:

L1={0n1n∣n≥0}L_1 = \left\{0^n1^n\mid n \geq 0\right\}

L2={wcwr∣w∈{0,1}∗}L_2 = \left\{wcw^r \mid w \in \{0,1\}^*\right\}

L3={wwr∣w∈{0,1}∗}L_3 = \left\{ww^r \mid w \in \{0,1\}^*\right\}

Here, wrw^r is the reverse of the string ww. Which of these languages are deterministic Context-free languages?

  1. A.

    None of the languages

  2. B.

    Only L1L_1

  3. C.

    Only L1L_1 and L2L_2

  4. D.

    All the three languages

Attempted by 268 students.

Sign up free to check your answer

Sign up free

Explore the full course: Gate Guidance By Sanchit Sir

Loading lesson…