Register

Recent questions tagged dpda

0 votes
0 answers
1
Can
Can $\Sigma^{*}$ be called DCFL? If yes, what would the state transition diagram of its PDA look like?
Can $\Sigma^{*}$ be called DCFL? If yes, what would the state transition diagram of its PDA look like?
User Avatar
2 votes
0 answers
3
gate academy
I think S1 is false because, for n=0, no 0’s will be added in stack, but in the transition to the next state (q2->q3) there is one mandatory 1 canceling out 0 in stack which will be absent in case of n=0. But solutions say S1 is true.
I think S1 is false because, for n=0, no 0’s will be added in stack, but in the transition to the next state (q2->q3) there is one mandatory 1 canceling out 0 in stack...
User Avatar
0 votes
0 answers
5
PDA | TOC | Practice Question | Unacademy Class
Construct PDA using empty stack method for the given language. $L=\left \{ x \space\ | \space\ x\in \left \{ a,b \right \}^{*} ; n_{a}(x) >= n_{b}(x) \right \}$ //number of a’s is greater than or equal to number of b’s
Construct PDA using empty stack method for the given language.$L=\left \{ x \space\ | \space\ x\in \left \{ a,b \right \}^{*} ; n_{a}(x) >= n_{b}(x) \right \}$//number of...
User Avatar
0 votes
6 answers
7
NIELIT 2017 DEC Scientist B - Section B: 39
Which of the following is true? Mealy and Moore machine are language acceptors. Finite State automata is language translator. NPDA is more powerful than DPDA. Melay machine is more powerful than Moore machine.
Which of the following is true?Mealy and Moore machine are language acceptors.Finite State automata is language translator.NPDA is more powerful than DPDA.Melay machine i...
User Avatar
0 votes
0 answers
10
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!
User Avatar
0 votes
1 answer
11
Introduction to computer theory
What should be the approach to draw the DFA - "All strings that have exactly one double letter in them" on symbols {a,b}.
What should be the approach to draw the DFA - "All strings that have exactly one double letter in them" on symbols {a,b}.
User Avatar
0 votes
1 answer
12
Push Down Automata
Consider Ldf set all languages accepted by DPDA by final state,Lef set of all languages accepted by DPDA by Empty stack Then A)Ldf proper subset of Lef. B)Ldf = Lef. C)Lef proper subset of Ldf. D)None .
Consider Ldf set all languages accepted by DPDA by final state,Lef set of all languages accepted by DPDA by Empty stack ThenA)Ldf proper subset of Lef.B)Ldf = Lef.C)Lef ...
User Avatar
0 votes
2 answers
13
Pushdown Automata
Among Deterministic pushdown automata and Non deterministic pushdown automata, which is more powerful and why ?
Among Deterministic pushdown automata and Non deterministic pushdown automata, which is more powerful and why ?
User Avatar
1 votes
0 answers
15
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.
User Avatar
0 votes
1 answer
18
Introduction to Computer Theory
Draw PDA for ((a^m)(b^n)(a^n)(b^m)) ?
Draw PDA for ((a^m)(b^n)(a^n)(b^m)) ?
User Avatar
4 votes
0 answers
19
Introduction to Computer Theory
Construct a PDA for the language of all those strings in which the number of $b 's$ is double the number of $a 's$. $a$ and $b$ can occur in any order. For example: $L=\{\text{^}, abb, bab, bba, aabbbb, ababbb, abbbabb, abbbab, abbba, ...... \}$
Construct a PDA for the language of all those strings in which the number of $b 's$ is double the number of $a 's$. $a$ and $b$ can occur in any order. For example:$L=\{\...
User Avatar
3 votes
1 answer
21
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
1 answer
22
#peterlinz
How can we show that { anbm, m>= n+2} is deterministic ? for eg for a4b6 or in general ?
How can we show that { anbm, m>= n+2} is deterministic ?for eg for a4b6 or in general ?
User Avatar
0 votes
0 answers
24
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
11 votes
1 answer
25
deterministic pushdown automata-prefix property
How to find DPDA’s that accept by null stack? Someone explain the prefix property for DPDA,How can we use this property?
How to find DPDA’s that accept by null stack?Someone explain the prefix property for DPDA,How can we use this property?
User Avatar
3 votes
1 answer
26
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
0 votes
0 answers
28
Push Down Automata
draw a deterministic PDA for ambn where, m = 2n+1
draw a deterministic PDA forambn where, m = 2n+1
User Avatar
1 votes
1 answer
30
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
To see more, click for the full list of questions or popular tags.