1,315 views
3 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 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)

Position:
Show:

Related questions

1 1 vote
0 0 answers
2.5k
2.5k views
Matrix asked Jul 28, 2018
2,518 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.
0 0 votes
1 1 answer
924
924 views
iarnav asked Sep 17, 2017
924 views
The following question is a modified version of this question https://gateoverflow.in/3785/gate2005-it-38, in this GATE question they have NPDA, but I'm asking about DPDA...
8 8 votes
3 answers 3 answers
8.0k
8.0k views
iarnav asked Sep 16, 2017
7,952 views
a) A DPDA which accepts by empty stack cannot accept all Regular Languages?b) All Regular Languages doesn't satisfy prefix property?
2 2 votes
1 1 answer
1.5k
1.5k views
eggs asked Feb 27, 2025
1,548 views
Which ONE of the following languages is accepted by a deterministic pushdown automaton?Any regular language.Any context-free language.Any language accepted by a non-deter...