0 votes 0 votes what will be the pushdown automata for the language, L=a^n b^m where n=2m+1. Rhythm asked Jan 3, 2019 Rhythm 810 views answer comment Share Follow See all 5 Comments See all 5 5 Comments reply Prateek Raghuvanshi commented Jan 3, 2019 reply Follow Share I think it will be the pda 1 votes 1 votes arya_stark commented Jan 3, 2019 i edited by arya_stark Jan 4, 2019 reply Follow Share Sir, this also can be pda of this??? @Prateek Raghuvanshi 0 votes 0 votes MiNiPanda commented Jan 3, 2019 reply Follow Share Connecting state q1 with final state will take care when m=0.. 0 votes 0 votes Prateek Raghuvanshi commented Jan 3, 2019 reply Follow Share @MiNiPanda if m>0 then it is correct right?? 0 votes 0 votes Prateek Raghuvanshi commented Jan 3, 2019 reply Follow Share @arya_stark it is not correct because in language a's are double than b's ,so we have to take care of that ,see my dpda. 0 votes 0 votes Please log in or register to add a comment.
