0 votes 0 votes Please can anyone explain the PDA for reverse of a string via a transition graph Theory of Computation pushdown-automata theory-of-computation + – Devshree Dubey asked Jun 28, 2018 edited Jun 28, 2018 by Devshree Dubey Devshree Dubey 691 views answer comment Share Follow See all 10 Comments See all 10 10 Comments reply Show 7 previous comments Devshree Dubey commented Jun 29, 2018 reply Follow Share @Shaik Masthan,A big Thanks to you brother for clearing my doubt. I've now understood what you want to convey. My doubt is now solved. Thank you for sparing your time brother.:) 1 votes 1 votes Winner commented Nov 1, 2019 reply Follow Share @Shaik Masthan if x here belongs to (a+b)* then how can I draw pda for it ,can you give some idea? 0 votes 0 votes Shaik Masthan commented Nov 1, 2019 i edited by Shaik Masthan Jul 6, 2021 reply Follow Share If x is belongs to (0+1)*, then it's npda.. DFA By keeping w = epsilon, x generate universal language. 0 votes 0 votes Please log in or register to add a comment.