3 votes 3 votes 1) Can a Deterministic PDA has two epsilon transition each reading different Stack symbol to perform a transition? 2) Can a transition be performed without reading Stack symbol at all. Like $ a, λ/ λ$? Theory of Computation theory-of-computation pushdown-automata dpda + – AskHerOut asked Oct 22, 2017 AskHerOut 738 views answer comment Share Follow See all 3 Comments See all 3 3 Comments reply Angkit commented Oct 22, 2017 i moved by Angkit Oct 22, 2017 reply Follow Share 1) Deterministic PDA cannot have epsilon. 2) NPDA can . 0 votes 0 votes AskHerOut commented Oct 22, 2017 reply Follow Share DPDA can actually has epsilon transition. They query was referring to a specific configuration. 0 votes 0 votes Angkit commented Oct 22, 2017 reply Follow Share If there is an epsilon transition from a state q, there must not be any alphabet transition from that state.One time only one symbol to be read... my opinion 0 votes 0 votes Please log in or register to add a comment.
0 votes 0 votes yes we can have a Deterministic PDA has two epsilon transition each reading different Stack symbol to perform a transition but there must not be any other symbol move reading same stack symbol as epsilon move. No according to definition of PDA, a symbol must be read from stack. δ: Q × Σε × Γε−→P(Q × Γε) is the transition function (This PDA definition from Michael sipser book is different than Peter linz and ullman) aaaakash001 answered Oct 6, 2022 aaaakash001 comment Share Follow See all 0 reply Please log in or register to add a comment.