L_{3} is Non deterministic CFL ...

Dark Mode

8,372 views

29 votes

Consider the following languages over the alphabet $\sum = \{0, 1, c\}$

$L_1 = \left\{0^n1^n\mid n \geq 0\right\}$

$L_2 = \left\{wcw^r \mid w \in \{0,1\}^*\right\}$

$L_3 = \left\{ww^r \mid w \in \{0,1\}^*\right\}$

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

- None of the languages
- Only $L_1$
- Only $L_1$ and $L_2$
- All the three languages

42 votes

Best answer

0