0 votes 0 votes what is the PDA for {L=$a^mb^n$ |m>n} Theory of Computation pushdown-automata theory-of-computation context-free-language + – aditi19 asked Sep 2, 2018 aditi19 994 views answer comment Share Follow See all 18 Comments See all 18 18 Comments reply Show 15 previous comments aditi19 commented Sep 28, 2018 reply Follow Share https://cstheory.stackexchange.com/questions/32271/are-dpdas-without-a-epsilon-moves-as-powerful-as-dpdas-with-them https://stackoverflow.com/questions/33000800/is-a-pushdown-automaton-with-an-epsilon-transition-a-ndpa 0 votes 0 votes Raghav Khajuria commented Sep 28, 2018 reply Follow Share Clarity means deterministic bcs b is following a so no a can come after b or b can't come before a.. DPDA would be like 0 votes 0 votes juuniversity commented Jul 5, 2021 reply Follow Share On state q2, q2(b,a,€) and q2(€,a,€) make it violating Dpda definition.... your diagram makes Npda… Please draw correct diagram... 0 votes 0 votes Please log in or register to add a comment.