menu
Login
Register
search
Log In
account_circle
Log In
Email or Username
Password
Remember
Log In
Register
I forgot my password
Register
Username
Email
Password
Register
add
Activity
Questions
Unanswered
Tags
Subjects
Users
Ask
Prev
Blogs
New Blog
Exams
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
Recent Posts
Update on GO Book for GATE 2022
Barc Interview Experience 2020- CSE stream
JEST 2021 registrations are open
TIFR GS-2021 Online Application portal
IIT Jodhpur Mtech AI - Interview Expierence (Summer Admission)
Subjects
All categories
General Aptitude
(2.1k)
Engineering Mathematics
(8.5k)
Digital Logic
(3k)
Programming and DS
(5.1k)
Algorithms
(4.5k)
Theory of Computation
(6.3k)
Compiler Design
(2.2k)
Operating System
(4.7k)
Databases
(4.3k)
CO and Architecture
(3.5k)
Computer Networks
(4.3k)
Non GATE
(1.2k)
Others
(1.3k)
Admissions
(595)
Exam Queries
(838)
Tier 1 Placement Questions
(16)
Job Queries
(71)
Projects
(19)
Unknown Category
(1.1k)
Recent Blog Comments
Thank You So Much...
Preparing for GATE 2021 hope I dont need this one...
Ohh, yeah now turned off. Got it sir, Thank you :)
I guess you might have turn on "Only GATE...
https://gateoverflow.in/280484/tifr2019-b-11 Arju...
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, λ/ λ$?
theory-of-computation
pushdown-automata
dpda
asked
Oct 22, 2017
in
Theory of Computation
AskHerOut
230
views
answer
comment
0
1) Deterministic PDA cannot have epsilon.
2) NPDA can .
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 add a comment.
Please
log in
or
register
to answer this question.
0
Answers
← 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
theory-of-computation
pushdown-automata
context-free-languages
dpda
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
pushdown-automata
theory-of-computation
finite-automata
context-free-languages
dpda
8
votes
2
answers
3
2.6k
views
True or False Question regarding DPDA and prefix property
a) A DPDA which accepts by empty stack cannot accept all Regular Languages? b) All Regular Languages doesn't satisfy prefix property?
a) A DPDA which accepts by empty stack cannot accept all Regular Languages? b) All Regular Languages doesn't satisfy prefix property?
asked
Sep 16, 2017
in
Theory of Computation
iarnav
2.6k
views
theory-of-computation
regular-languages
pushdown-automata
dpda
context-free-languages
finite-automata
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
theory-of-computation
pushdown-automata
dpda
...