0 votes 0 votes unable to understand 2nd point: Theory of Computation pushdown-automata ace-test-series theory-of-computation + – raviyogi asked Nov 4, 2017 edited Mar 7, 2019 by Rishi yadav raviyogi 418 views answer comment Share Follow See all 3 Comments See all 3 3 Comments reply Mk Utkarsh commented Mar 25, 2018 reply Follow Share The second point $\delta (q_{i},a,x) \neq \phi$ means at any state, for any input symbol and any stack top, machine has to make a move. It cannot be empty. $\delta (q_{i},\epsilon ,x) = \phi$ means at any state, for an empty string and any stack top, machine cannot make any move but this incorrect. DPDA's are allowed to make stack move with an empty input symbol. Correct me if i'm wrong 0 votes 0 votes ShruteeP commented Sep 18, 2018 reply Follow Share Could you also explain the first point with the modulus 0 votes 0 votes Magma commented Sep 18, 2018 reply Follow Share This is very interesting question Someone explain properly 0 votes 0 votes Please log in or register to add a comment.
0 votes 0 votes This Question states the two condition for Deterministic PDA. This is from j.d.ullman TOC book aaaakash001 answered Oct 6, 2022 aaaakash001 comment Share Follow See all 0 reply Please log in or register to add a comment.