0 votes 0 votes L={a$^{n}$b$^{n}$c$^{m}$ |m>n} L={a$^{n}$b$^{n}$c$^{m}$ |n>m} identify lang amit166 asked Sep 24, 2018 amit166 396 views answer comment Share Follow See all 4 Comments See all 4 4 Comments reply aambazinga commented Sep 24, 2018 i edited by aambazinga Sep 25, 2018 reply Follow Share both are CSL, as two comparisons are there.. for equating a & b and for comparing a,b & c. if we will take union of the two.. then also it will become CSL. Edit: union will also be CSL as none of the conditions are containing equality 1 votes 1 votes !KARAN commented Sep 24, 2018 reply Follow Share aambazinga How the union will make it CFL as both the languages are CSL. 0 votes 0 votes sandygate commented Sep 24, 2018 reply Follow Share according to me if we take the union of above two languages then we will get the language $a^{n}b^{n}c^{m}$ in which m!=n theirfore the resulting language is csl only 0 votes 0 votes !KARAN commented Sep 25, 2018 reply Follow Share sandygate No its not possible as both the languages are CSL because you have to check for 2 conditions at a time ie equality of $n$ and $n>m$. CFL can't do 2 simultaneous checking. So individually both the languages are CSL. And even if you take union then also you need to perform 2 conditions checking. 0 votes 0 votes Please log in or register to add a comment.
0 votes 0 votes if apply closure properties we get csl because csl is closed under union Raghav Khajuria answered Sep 24, 2018 Raghav Khajuria comment Share Follow See all 0 reply Please log in or register to add a comment.