0 votes 0 votes Consider the languages given below. $L1 =$ {$a$^$n$ $b$^$m$ $c$^$m$ $d$^$n$ $|n >= 1$ and $m >= 1$} $L2 =$ {$a$^$n$ $b$^$n$ $|n >= 1$} $L3 =$ {$a$^$n$ $b$^$n$ $c$^$n$ $|n>=0$ } Find the correct statement from the following: $L1, L2$ and $L3$ are context Free languages $L1, L2$ are but not $L3$, are context free Languages $L2, L3$ are context free but not $L1$ Only $L2$ is context free GATE tbb-mockgate-1 identify-class-language theory-of-computation + – Bikram asked Jan 16, 2017 • retagged Jan 9, 2020 by Arjun Bikram 295 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
Best answer 1 votes 1 votes The equivalent context free grammar for L1 is, S -> aSd|aAd, A -> bAc | bc Bikram answered Jan 16, 2017 • selected Feb 7, 2017 by Bikram Bikram comment Share Follow See all 0 reply Please log in or register to add a comment.