Login
Register
@
Dark Mode
Profile
Edit my Profile
Messages
My favorites
Register
Activity
Q&A
Questions
Unanswered
Tags
Subjects
Users
Ask
Previous Years
Blogs
New Blog
Exams
Dark Mode
Recent questions tagged dpda
0
votes
0
answers
1
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.
h4kr
asked
in
Theory of Computation
Nov 20
by
h4kr
75
views
theory-of-computation
dpda
0
votes
0
answers
2
PDA | TOC | Practice Question
Identify the type of the given language and draw the corresponding automata for the language. $L=\left \{a^{i}b^{j}c^{k} \space\ | \space\ j=max(i,k) \right \}$ A] Regular B] DCFL C] CFL but not DCFL D] Non-CFL Please describe your selection.
anupamsworld
asked
in
Theory of Computation
Sep 2
by
anupamsworld
124
views
regular-grammar
context-free-grammar
npda
dpda
theory-of-computation
0
votes
0
answers
3
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
anupamsworld
asked
in
Theory of Computation
Sep 1
by
anupamsworld
69
views
npda
dpda
theory-of-computation
0
votes
2
answers
4
NIELIT 2017 DEC Scientific Assistant A - Section B: 6
Which of the following statements is true ? Melay and Moore machines are language acceptors. Finite State automata is language translator. NPDA is more powerful than DPDA. Melay machine is more powerful than Moore machine.
Lakshman Patel RJIT
asked
in
Theory of Computation
Mar 31, 2020
by
Lakshman Patel RJIT
717
views
nielit2017dec-assistanta
theory-of-computation
dpda
npda
0
votes
6
answers
5
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.
Lakshman Patel RJIT
asked
in
Theory of Computation
Mar 30, 2020
by
Lakshman Patel RJIT
4.8k
views
nielit2017dec-scientistb
theory-of-computation
finite-automata
npda
dpda
0
votes
0
answers
6
Michael Sipser Edition 3 Exercise 4 Question 32 (Page No. 213)
The proof of Lemma $2.41$ says that $(q, x)$ is a looping situation for a $DPDA \:P$ if when $P$ is started in state $q$ with $x \in \Gamma$ on the top of the stack, it never pops anything below $x$ and it never reads an input ... decidable, where $F = \{ \langle P, q, x \rangle \mid (q, x)\: \text{is a looping situation for P}\}$.
Lakshman Patel RJIT
asked
in
Theory of Computation
Oct 17, 2019
by
Lakshman Patel RJIT
235
views
michael-sipser
theory-of-computation
dpda
decidability
proof
0
votes
0
answers
7
Ullman (TOC) Edition 3 Exercise 8.5 Question 2 (Page No. 362)
The purpose of this exercise is to show that a one-stack machine with an endmarker on the input has no more power than a deterministic $PDA$. $L\$ is the concatenation of language $L$ with the language containing only the one string $\$ ... $q$ such that $P$,started in $ID\ (q,a,X_{i}X_{i+1}\cdot \cdot X_{n})$ will accept.
Lakshman Patel RJIT
asked
in
Theory of Computation
Jul 21, 2019
by
Lakshman Patel RJIT
132
views
ullman
theory-of-computation
turing-machine
dpda
descriptive
0
votes
0
answers
8
Draw PDA for this
L = { a^m b^n c^k=m+n } Please draw PDA for this Language!
Guilherme Zanini Mor
asked
in
Theory of Computation
Dec 12, 2018
by
Guilherme Zanini Mor
354
views
theory-of-computation
pushdown-automata
dpda
0
votes
1
answer
9
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}.
Jeevesh
asked
in
Theory of Computation
Nov 12, 2018
by
Jeevesh
487
views
theory-of-computation
finite-automata
dpda
0
votes
1
answer
10
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 .
Abhisek Tiwari 4
asked
in
Theory of Computation
Nov 6, 2018
by
Abhisek Tiwari 4
476
views
theory-of-computation
pushdown-automata
dpda
context-free-grammar
0
votes
2
answers
11
Pushdown Automata
Among Deterministic pushdown automata and Non deterministic pushdown automata, which is more powerful and why ?
Shamim Ahmed
asked
in
Theory of Computation
Oct 25, 2018
by
Shamim Ahmed
760
views
theory-of-computation
pushdown-automata
dpda
0
votes
0
answers
12
Pushdown Automata
Sambhrant Maurya
asked
in
Theory of Computation
Oct 19, 2018
by
Sambhrant Maurya
455
views
pushdown-automata
theory-of-computation
dpda
1
vote
0
answers
13
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.
Matrix
asked
in
Theory of Computation
Jul 28, 2018
by
Matrix
1.2k
views
theory-of-computation
pushdown-automata
context-free-language
dpda
1
vote
1
answer
14
ISRO CS 17
Consider the following statements about the context free grammar G = {S-->SS , S-->ab , S-->ba , S-->^} I. G is ambiguous II. G produces all strings with equal number of a's and b's III. G can be accepted by a deterministic PDA. Which combination below expresses all ... ? A) I only B) I and III C) II and II D) All I,II,III In a answer key shown answer D but II is not right.
Nikhil Patil
asked
in
Theory of Computation
Jun 13, 2018
by
Nikhil Patil
942
views
userisro2017
usermod
theory-of-computation
dcfl
dpda
0
votes
1
answer
15
pushdown-automata
sumitr
asked
in
Theory of Computation
Apr 23, 2018
by
sumitr
316
views
theory-of-computation
pushdown-automata
dpda
self-doubt
0
votes
1
answer
16
Introduction to Computer Theory
Draw PDA for ((a^m)(b^n)(a^n)(b^m)) ?
The Capricorn
asked
in
Theory of Computation
Apr 13, 2018
by
The Capricorn
271
views
theory-of-computation
dpda
npda
4
votes
0
answers
17
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, ...... \}$
The Capricorn
asked
in
Theory of Computation
Mar 28, 2018
by
The Capricorn
471
views
theory-of-computation
npda
dpda
2
votes
2
answers
18
test_series
shivanisrivarshini
asked
in
Theory of Computation
Mar 7, 2018
by
shivanisrivarshini
218
views
theory-of-computation
dpda
regular-language
3
votes
1
answer
19
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 ?
ankitgupta.1729
asked
in
Theory of Computation
Mar 4, 2018
by
ankitgupta.1729
483
views
theory-of-computation
pushdown-automata
dpda
npda
0
votes
1
answer
20
#peterlinz
How can we show that { anbm, m>= n+2} is deterministic ? for eg for a4b6 or in general ?
Pawan Kumar 2
asked
in
Theory of Computation
Dec 11, 2017
by
Pawan Kumar 2
165
views
dpda
1
vote
2
answers
21
Arrange in the increasing order of power of following automata-
Realtime DPDA with Null Store,Real time DPDA with final state, DPDA with NULL store,DPDA with final state, NPDA
Durgesh Singh
asked
in
Theory of Computation
Dec 11, 2017
by
Durgesh Singh
2.0k
views
theory-of-computation
pushdown-automata
dpda
npda
0
votes
0
answers
22
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....
shivangi5
asked
in
Theory of Computation
Dec 1, 2017
by
shivangi5
288
views
theory-of-computation
pushdown-automata
dpda
11
votes
1
answer
23
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?
set2018
asked
in
Theory of Computation
Nov 2, 2017
by
set2018
2.7k
views
theory-of-computation
self-doubt
dpda
3
votes
1
answer
24
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, λ/ λ$?
AskHerOut
asked
in
Theory of Computation
Oct 22, 2017
by
AskHerOut
399
views
theory-of-computation
pushdown-automata
dpda
0
votes
1
answer
25
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 Σ*.
iarnav
asked
in
Theory of Computation
Sep 17, 2017
by
iarnav
401
views
pushdown-automata
theory-of-computation
finite-automata
context-free-language
dpda
0
votes
0
answers
26
Push Down Automata
draw a deterministic PDA for ambn where, m = 2n+1
NIKU
asked
in
Theory of Computation
Sep 16, 2017
by
NIKU
237
views
theory-of-computation
pushdown-automata
dpda
8
votes
3
answers
27
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?
iarnav
asked
in
Theory of Computation
Sep 16, 2017
by
iarnav
4.5k
views
theory-of-computation
regular-language
pushdown-automata
dpda
context-free-language
finite-automata
1
vote
1
answer
28
Deterministic Push Down Automata
What is main difference between Deterministic Push down automata and simple Push down automata ?
ashutoshaay26
asked
in
Theory of Computation
Aug 15, 2017
by
ashutoshaay26
854
views
theory-of-computation
dpda
pushdown-automata
To see more, click for the
full list of questions
or
popular tags
.
Subscribe to GATE CSE 2023 Test Series
Subscribe to GO Classes for GATE CSE 2023
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
ISRO RECRUITMENT FOR SCIENTIST B THROUGH GATE
POWER GRID CORPORATION OF INDIA LIMITED
INSTITUTE OF BANKING PERSONNEL SELECTION
GATE Overflow books for TIFR, ISRO, UGCNET and NIELIT
RECRUITMENT IN OIL AND GAS CORPORATION LIMITED
Subjects
All categories
General Aptitude
(2.4k)
Engineering Mathematics
(9.1k)
Digital Logic
(3.2k)
Programming and DS
(5.8k)
Algorithms
(4.5k)
Theory of Computation
(6.6k)
Compiler Design
(2.3k)
Operating System
(4.9k)
Databases
(4.5k)
CO and Architecture
(3.7k)
Computer Networks
(4.5k)
Non GATE
(1.3k)
Others
(2.4k)
Admissions
(647)
Exam Queries
(841)
Tier 1 Placement Questions
(17)
Job Queries
(74)
Projects
(9)
Unknown Category
(855)
Recent questions tagged dpda
Recent Blog Comments
@abir_banerjee Thanks Abir. I'm third year...
@nolan_keats Currently I am in third year...
@abir_banerjee thank you Abir.Supposing you...
@nolan_keats just a suggestion as I also...
@abir_banerjee Hope I can do this in span of one...