2 votes 2 votes I think S1 is false because, for n=0, no 0’s will be added in stack, but in the transition to the next state (q2->q3) there is one mandatory 1 canceling out 0 in stack which will be absent in case of n=0. But solutions say S1 is true. Theory of Computation theory-of-computation dpda virtual-gate-test-series + – h4kr asked Nov 20, 2022 • retagged Dec 28, 2022 by h4kr h4kr 328 views answer comment Share Follow See all 3 Comments See all 3 3 Comments reply Shoto commented Nov 20, 2022 reply Follow Share S1 is correct, we are pushing 0 onto the stack without seeing anything 1 votes 1 votes raja11sep commented Nov 21, 2022 reply Follow Share for n=0 q2 → q3 transition will never occur. both statements are correct. 1 votes 1 votes nishantsharma commented Nov 21, 2022 reply Follow Share See q1 is also final state, hence null string is also accepted 0 votes 0 votes Please log in or register to add a comment.