0 votes 0 votes (a^n)^m b^n for m,n>=1 is 1)DCFL 2)CFL or 3)CSL RahulRoy31 asked Dec 28, 2018 RahulRoy31 433 views answer comment Share Follow See all 6 Comments See all 6 6 Comments reply balchandar reddy san commented Dec 28, 2018 reply Follow Share From my understanding, a^mn b^n is NDCFL a->push x | b->pop x (but we are unaware of how many no.of x's to pop, so it is definitely not DCFL) after reading the final b and stack is not empty, then we can reject the grammar. 0 votes 0 votes MiNiPanda commented Dec 28, 2018 reply Follow Share I think its CSL..such computation isn't possible using PDA.. 0 votes 0 votes Kunal Kadian commented Dec 28, 2018 reply Follow Share Not DCFL, Not CFL for sure 0 votes 0 votes Shaik Masthan commented Dec 28, 2018 reply Follow Share the given question is equivalent to L = {a$^k$. b$^p$ | k = p.i where k,p ≥ 1 and i ≥ 1 } Now check what this language is ? 0 votes 0 votes Magma commented Dec 28, 2018 reply Follow Share CSL right ?? 0 votes 0 votes RahulRoy31 commented Dec 28, 2018 reply Follow Share Though I am not sure about answer but I think it can be CFL not DCFL because k=p.i means k>=p. Correct me if I am wrong. 0 votes 0 votes Please log in or register to add a comment.