1 votes 1 votes Identify the language. apbqcrds | p+r=q+s Theory of Computation theory-of-computation identify-class-language + – gari asked Jan 1, 2018 gari 616 views answer comment Share Follow See all 11 Comments See all 11 11 Comments reply sachin! commented Jan 1, 2018 reply Follow Share Dcfl 0 votes 0 votes gari commented Jan 1, 2018 reply Follow Share please explain also. 0 votes 0 votes joshi_nitish commented Jan 1, 2018 reply Follow Share it's a DCFL 0 votes 0 votes gari commented Jan 1, 2018 reply Follow Share @ joshi_nitish yes answer is Dcfl... can u explain why not csl and why it's dcfl? 0 votes 0 votes hs_yadav commented Jan 1, 2018 i reshown by hs_yadav Jan 2, 2018 reply Follow Share not a CFL it is CSl.... 0 votes 0 votes LeenSharma commented Jan 2, 2018 reply Follow Share If a language is CFL then it will also a CSL but not vice versa. CFL is the subset of CSL. 0 votes 0 votes hs_yadav commented Jan 2, 2018 reply Follow Share @ LeenSharma i think u r misssing something.....here laanguage... is apbqcrds | p+r=q+s ....and ur PDA is also accepting string.... aaabbccccd .. given language must be CSL 0 votes 0 votes gari commented Jan 2, 2018 reply Follow Share @LeenSharma i think there is something wrong with the pda... try to run string abbcccdd....it doesn't terminate on final state... 0 votes 0 votes hs_yadav commented Jan 2, 2018 reply Follow Share @ gari @LeenSharma PDA is for ...apbrcqds |p+r=q+s .. .. but ur question is : a .apbrcqds |p+q=r+s . here is other case when you will push 'a' to stack then if no. of b becomes greater then a then we would not be able to keep count of number of b.... :- 0 votes 0 votes joshi_nitish commented Jan 2, 2018 reply Follow Share @gari, @hs_yadav, @LeenSharma its a clear-cut DCFL, but its little tricky, see below its DPDA, i have used x for a,c and y for b,d 2 votes 2 votes gari commented Jan 2, 2018 reply Follow Share thanks @ joshi_nitish. Your PDA made the concept clear:) 0 votes 0 votes Please log in or register to add a comment.