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 578 views answer comment Share Follow See all 11 Comments See all 11 11 Comments reply Show 8 previous comments 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.