737 views
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, λ/ λ$?

1 Answer

0 votes
0 votes
  1. 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.
  2. 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)

Related questions

1 votes
1 votes
0 answers
1
Matrix asked Jul 28, 2018
1,545 views
Is this approach of acceptance by empty stack correct ?I am confused because i have read that acceptance by empty stack may not be able to accept all regular languages.
8 votes
8 votes
3 answers
3
0 votes
0 votes
0 answers
4