menu
search
Log In
Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true

Subjects

Network Sites

 GO Mechanical
 GO Electrical
 GO Electronics
 GO Civil
 CSE Doubts

DPDA: One Liners

3 votes
230 views
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, λ/ λ$?
in Theory of Computation 230 views
0
1) Deterministic PDA cannot have epsilon.

2) NPDA can .

moved by
0
DPDA can actually has epsilon transition. They query was referring to a specific configuration.
0
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

Please log in or register to answer this question.

← Prev. Next →
← Prev. Qn. in Sub. Next Qn. in Sub. →

Related questions

1 vote
0 answers
1
744 views
DPDA acceptance by empty stack
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.
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.
asked Jul 28, 2018 in Theory of Computation Matrix 744 views
0 votes
0 answers
2
254 views
Question Regarding DPDA acceptance inspired from GATE 2005 Question
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 Let D be a deterministic push-down automaton (DPDA) with exactly one state ... . Both L(P) and N(P) are necessarily Σ*. Neither L(P) nor N(P) are necessarily Σ*.
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 Let D be a deterministic push-down automaton (DPDA) with exactly one state, q, and exactly one symbol, Z, in its stack ... P) is not necessarily Σ*. Both L(P) and N(P) are necessarily Σ*. Neither L(P) nor N(P) are necessarily Σ*.
asked Sep 17, 2017 in Theory of Computation iarnav 254 views
0 votes
0 answers
4
155 views
Draw PDA for this
L = { a^m b^n c^k=m+n } Please draw PDA for this Language!
L = { a^m b^n c^k=m+n } Please draw PDA for this Language!
asked Dec 12, 2018 in Theory of Computation Guilherme Zanini Mor 155 views
Dark theme
Muffin by Hélio Chun
Thanks to Q2A
...