0 votes 0 votes 1)What is the main difference while drawing the PDA of {an bn | n>=0 } and {an bn | n>=1} ? 2)How does PDA changes when we have 0 in it as a constraint . 3)For all other cases how does the PDA changes on inclusion of 0. Theory of Computation pushdown-automata + – dragonball asked Oct 29, 2017 edited Oct 29, 2017 by srestha dragonball 531 views answer comment Share Follow See all 2 Comments See all 2 2 Comments reply srestha commented Oct 29, 2017 reply Follow Share 1) {an bn | n>=0 } here CFL contains epsilon {an bn | n>=1 }here CFL doesnot contain epsilon 2) In pda in 1st case initial state can be final state But in 2nd one atleast one more state required to get a final state 0 votes 0 votes dragonball commented Oct 29, 2017 reply Follow Share I did not get it . Could u explain this with a suitable diagram for both cases . 0 votes 0 votes Please log in or register to add a comment.
0 votes 0 votes L1: (an bn | n>=0 } L2: {an bn | n>=1} only difference is L1 accepts null string and L2 doesn’t. while making PDA we must ensure strings not in language must be rejected. if we construct PDA for L2 and just make initial state as final state then it will accept language L1 but also start accepting only a’s. aaaakash001 answered Oct 6, 2022 aaaakash001 comment Share Follow See all 0 reply Please log in or register to add a comment.