36. Two Stack PDA | 2 Stack PDA

[@rsanche4726]

I am doing a homework, and I am supposed to draw a 2PDA for a language that accepts a^i b^(i*j) c^j i,j >= 0. I tried the method of pushing a's in stack 1, then when I am reading b's I push them in stack 2, and lastly when I read c's, I pop for each c read, I pop b's a times. So if I have aabbbbcc. Then when I read a c, I pop two b's in Stack 2 because there are two a's in stack 1. Then I read another c, and I pop 2 b's again. Accept if stack 2 is empty. The problem is, how would we know how many a's we have in Stack 1? Is this method even going to lead me anywhere? Keep up the videos!

[@aparna9710]

Example complete cheyandhi madam..

[@harinathreddy6203]

akkaaaaaaa nuvvu tapppu chepppaaaavvvvvvvvvv................!!!!!!!!!!!!!!!