Register

Recent questions tagged pushdown-automata

1 votes
0 answers
121
Pda Automata
Why only stack data structure is used for implementing pushdown automata(pda) why not others ???
Why only stack data structure is used for implementing pushdown automata(pda) why not others ???
User Avatar
0 votes
1 answer
122
PDA for a language
$a^i b^j / i$ should not be equal to $2j+1$ give PDA for this language
$a^i b^j / i$ should not be equal to $2j+1$give PDA for this language
User Avatar
3 votes
1 answer
126
Power of Pushdown Machines
Which is more powerful :- 2-way Non-Deterministic Pushdown Machine(NDPDM) or 2-way Deterministic Pushdown Machine(DPDM) ? (or) Do both machine models have the same power ?
Which is more powerful :- 2-way Non-Deterministic Pushdown Machine(NDPDM) or 2-way Deterministic Pushdown Machine(DPDM) ? (or) Do both machine models have the same power ...
User Avatar
0 votes
0 answers
128
Non-Deterministic PDA
I'm getting its equaltion {anbn | n > 0} U {a} U {b} But given is {anbn | n >= 0} U {a} U {b} Whether epsilon is accepted or not??
I'm getting its equaltion {anbn | n 0} U {a} U {b}But given is {anbn | n >= 0} U {a} U {b}Whether epsilon is accepted or not??
User Avatar
1 votes
2 answers
130
DCFL or not??
$L1 = \bigl\{a^mb^nc^pd^q \mid m+q = n+p \bigr\}$ $L2 = \bigl\{a^mb^nc^pd^q \mid m+p = n+q \bigr\}$ 1. L1 is DCFL, L2 is not 2. L2 is DCFL, L1 is not 3. Both are not DCFL 4. Both are DCFL
$L1 = \bigl\{a^mb^nc^pd^q \mid m+q = n+p \bigr\}$$L2 = \bigl\{a^mb^nc^pd^q \mid m+p = n+q \bigr\}$1. L1 is DCFL, L2 is not2. L2 is DCFL, L1 is not3. Both are not DCFL...
User Avatar
0 votes
1 answer
131
TOC PDA
Is my PDA right ?
Is my PDA right ?
User Avatar
0 votes
0 answers
133
Push Down Automata
Consider the following statement: S: Set of languages accepted by DPDA by empty stack contain only those DCFL’s with prefix property. Please explain as why this sentence is wrong....
Consider the following statement:S: Set of languages accepted by DPDA by empty stack contain only those DCFL’s with prefix property.Please explain as why this sentence ...
User Avatar
0 votes
0 answers
135
MadeEasy Subject Test: Theory of Computation - Pushdown Automata
Why in DPDA acceptance by empty stack and acceptance by final state is not equivalent ? How this prefix property plays important role ?
Why in DPDA acceptance by empty stack and acceptance by final state is not equivalent ? How this prefix property plays important role ?
User Avatar
1 votes
3 answers
142
Pushdown Automata Question
i) I, II, III ii) I, II only iii) I only iv) none of the above
i) I, II, IIIii) I, II onlyiii) I onlyiv) none of the above
User Avatar
0 votes
1 answer
143
PDA Construction
1)What is the main difference while drawing the PDA of {an bn | n>=0 } and {an bn | n>=1} ? 2)How does PDA changes when we have 0 in it as a constraint . 3)For all other cases how does the PDA changes on inclusion of 0.
1)What is the main difference while drawing the PDA of {an bn | n>=0 } and {an bn | n>=1} ?2)How does PDA changes when we have 0 in it as a constraint .3)For all other c...
User Avatar
1 votes
1 answer
144
PDA Doubt
In the below diagram which solution is correct and why ?
In the below diagram which solution is correct and why ?
User Avatar
0 votes
0 answers
145
Problem while making a PDA
I feel it difficult to know when to change the state while making a PDA. Could anyone tell me in detailed manner when to cahnge the state . Below is the solution to a problem , could anyone tell me which one is more appropriate with justification.
I feel it difficult to know when to change the state while making a PDA.Could anyone tell me in detailed manner when to cahnge the state .Below is the solution to a probl...
User Avatar
3 votes
1 answer
146
DPDA: One Liners
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) 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 s...
User Avatar
1 votes
3 answers
148
Draw PDA for this
L = {cambndn} Please draw PDA for this Language!
L = {cambndn} Please draw PDA for this Language!
User Avatar
0 votes
0 answers
150
Push Down Automata
draw a deterministic PDA for ambn where, m = 2n+1
draw a deterministic PDA forambn where, m = 2n+1
User Avatar
Page: