Register

Recent questions tagged pushdown-automata

2 votes
3 answers
152
What is Prefix Property in TOC?
Can someone explain what's this prefix property, there's no proper explanation on google and may you please explain with taking some examples. Thanks.
Can someone explain what's this prefix property, there's no proper explanation on google and may you please explain with taking some examples. Thanks.
User Avatar
0 votes
2 answers
153
How to draw PDA for given Language?
$L=\{a^nb^n\mid n≥0\}$ Kindly draw a PDA for this, I'm confused, how to deal with epsilon string?
$L=\{a^nb^n\mid n≥0\}$ Kindly draw a PDA for this, I'm confused, how to deal with epsilon string?
User Avatar
0 votes
1 answer
155
TOC PDA
construct a pda fora^mb^n such that m=2n+1?
construct a pda fora^mb^n such that m=2n+1?
User Avatar
1 votes
3 answers
156
PDA =FA+1stack??
we know that PDA = FA+1stack so why we use the stack data structure in PDA, we have much more data structure like linked liste,queue, array or tree/hashing???
we know that PDA = FA+1stack so why we use the stack data structure in PDA, we have much more data structure like linked liste,queue, array or tree/hashing???
User Avatar
2 votes
0 answers
157
Prefix property and DPDA
Construct the DPDA with empty stack and final state method for the language L = ${ a^n b^n / n>= 0}$.
Construct the DPDA with empty stack and final state method for the language L = ${ a^n b^n / n>= 0}$.
User Avatar
1 votes
1 answer
158
Deterministic Push Down Automata
What is main difference between Deterministic Push down automata and simple Push down automata ?
What is main difference between Deterministic Push down automata and simple Push down automata ?
User Avatar
1 votes
0 answers
159
Push Down AUTOMATA
which PDA is more Powerful Deterministic or Non Deterministic and why?
which PDA is more Powerful Deterministic or Non Deterministic and why?
User Avatar
1 votes
1 answer
162
Design PDA for
Design PDA for i) L={a^n b^m c^n|m,n>=1} ii) L={a^m b^n c^p|m+n=p} iii) L={a^i b^i c^j|i,j=1} iv) L={a^i b^j c^j|i,j>=1} I have made an attempt to draw pda Please can someone crosscheck the answer?
Design PDA for i) L={a^n b^m c^n|m,n>=1}ii) L={a^m b^n c^p|m+n=p}iii) L={a^i b^i c^j|i,j=1}iv) L={a^i b^j c^j|i,j>=1}I have made an attempt to draw pda Please can someone...
User Avatar
1 votes
1 answer
163
TOC PDA
True/False 1. In PDA, if Final state = phi(empty) ,then language accepted =phi. 2. In PDA, if Final state != phi(empty) ,then PDA will always accept at least one string..
True/False1. In PDA, if Final state = phi(empty) ,then language accepted =phi.2. In PDA, if Final state != phi(empty) ,then PDA will always accept at least one string..
User Avatar
0 votes
2 answers
169
NPDA and DPDA
Can we make NPDA? L= {anbn| n>=0,a,b are input variables} if yes then make it .
Can we make NPDA? L= {anbn| n>=0,a,b are input variables}if yes then make it .
User Avatar
1 votes
0 answers
170
#pda #tm #deterministic
How can a DTM can simulate a NTM, but a DPDA can not simulate a NPDA. ? Reason? I read the proedure for a DTM to simulate a NTM but can not get why its not so with pda. Any clue ?
How can a DTM can simulate a NTM, but a DPDA can not simulate a NPDA. ? Reason?I read the proedure for a DTM to simulate a NTM but can not get why its not so with pda. A...
User Avatar
12 votes
1 answer
173
ISI 2015 PCB C4 A
Design a context free grammar for the language consisting of all strings over $\mathbf{\{a,b\}}$ that are not the form $\mathbf{ww}$ for any string $\mathbf{w}$
Design a context free grammar for the language consisting of all strings over $\mathbf{\{a,b\}}$ that are not the form $\mathbf{ww}$ for any string $\mathbf{w}$
User Avatar
1 votes
1 answer
174
PDA..
Plz describe your ans too
Plz describe your ans too
User Avatar
1 votes
1 answer
175
TestBook
How to interpret the transitions? I interpreted as L={a*}
How to interpret the transitions? I interpreted as L={a*}
User Avatar
1 votes
1 answer
177
Pda question
Is WcW CFG?
Is WcW CFG?
User Avatar
2 votes
1 answer
179
Working with PDA transitions
Either I dont understand PDA at all or this question is wrong or I am missing something very basic:
Either I dont understand PDA at all or this question is wrong or I am missing something very basic:
User Avatar
0 votes
1 answer
180
Non deterministic PDA
Can the NPDA constructed to accept L, such that L = L1 U L2 , L1 = {1n 0n | n > 0} and L2 = {0n 12n | n > 0} be drawn like this? This is an informal representation of NPDA. Is this correct? Or should the NPDA accepting language L should have 2 final states?
Can the NPDA constructed to accept L, such that L = L1 U L2 , L1 = {1n 0n | n 0} and L2 = {0n 12n | n 0} be drawn like this?This is an informal representation of NPDA. ...
User Avatar
Page: