Computer Sciences > GATE 2014 SET-3 > Context-Free Languages
Consider the following languages over the alphabet Σ = {0, 1, c}:
L₁ = {0ⁿ1ⁿ | n ≥ 0}
L₂ = {wcwʳ | w ∈ {0, 1}*}
L₃ = {wwʳ | w ∈ {0, 1}*}
Here, wʳ is the reverse of the string w. Which of these languages are deterministic Context-free languages?
L₁ = {0ⁿ1ⁿ | n ≥ 0}
L₂ = {wcwʳ | w ∈ {0, 1}*}
L₃ = {wwʳ | w ∈ {0, 1}*}
Here, wʳ is the reverse of the string w. Which of these languages are deterministic Context-free languages?
Correct : c
Similar Questions
Consider the following two languages over the alphabet {a, b, c}, where m and n are natural numbers.L1={ambmcm+n|m,n≥1}L2={ambncm+n|m,n≥1}Which ONE of the...
Consider the following two languages over the alphabet {a, b, c}, where m and n are natural numbers.L1={ambmcm+n|m,n≥1}L2={ambncm+n|m,n≥1}Which ONE of the...
Consider the following two languages over the alphabet {a, b, c}, where m and n are natural numbers.L1={ambmcm+n|m,n≥1}L2={ambncm+n|m,n≥1}Which ONE of the...
Total Unique Visitors
Loading......