The Gateway to Computer Science Excellence
For all GATE CSE Questions
Toggle navigation
GATE Overflow
Facebook Login
Google Login
or
Email or Username
Password
Remember
Login
Register

I forgot my password
Activity
Questions
Unanswered
Tags
Subjects
Users
Ask
Prev
Blogs
New Blog
Exams
First time here? Checkout the
FAQ
!
x
×
Close
Use the google search bar on side panel. It searches through all previous GATE/other questions. For hardcopy of previous year questions please see
here
Recent questions tagged pushdownautomata
0
votes
0
answers
1
pda doubt
Consider the following PDA: The language accepted by the given PDA is: L = {(b^n a b^n a )^m  m, n >= 0} L = {b^n a b^n a  n >= 0} {bn  n >= 0} L = {b^n a b^n a  n >= 0} L = {(b^n a b^n a )^m  m, n >= 0} {bn  n >= 0}
asked
1 day
ago
in
Theory of Computation
by
Satbir
Active
(
1.1k
points)

17
views
pushdownautomata
theoryofcomputation
0
votes
0
answers
2
PDA toc
Plz tell me answer of the below question In automaton theory ,a PDA is a variation of: 1)finite automaton that can make use of a stack containing data 2)infinite automaton that can make use of a stack containing data 3)both A and B 4)none of the above
asked
3 days
ago
in
Theory of Computation
by
Shivshankar
(
41
points)

23
views
pushdownautomata
0
votes
0
answers
3
TOC  PDA
Consider a push down automata (PDA) below which runs over the input alphabet (a, b). It has the stack alphabet {z0, X}, where z0 is the bottom of stack marker. The set of states of PDA is {q0,q1} where q0 is the start state and rules of the PDA are, (The languare accepted by the grammar is)
asked
Nov 30
in
Theory of Computation
by
rahuljai
(
35
points)

36
views
pushdownautomata
theoryofcomputation
contextfreelanguage
grammar
cfg
0
votes
0
answers
4
How to draw PDA For following language
asked
Nov 26
in
Theory of Computation
by
radha gogia
Loyal
(
7.9k
points)

32
views
pushdownautomata
theoryofcomputation
0
votes
0
answers
5
Important doubt in TOC
Can someone please explain how and what above PDA is computing
asked
Nov 17
in
Theory of Computation
by
Pavan Shetty
(
87
points)

13
views
theoryofcomputation
pushdownautomata
0
votes
1
answer
6
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 .
asked
Nov 6
in
Theory of Computation
by
Abhisek Tiwari 4
Active
(
1.9k
points)

32
views
theoryofcomputation
pushdownautomata
dpda
contextfreegrammars
0
votes
2
answers
7
Pushdown Automata
Among Deterministic pushdown automata and Non deterministic pushdown automata, which is more powerful and why ?
asked
Oct 25
in
Theory of Computation
by
Shamim Ahmed
Junior
(
935
points)

56
views
theoryofcomputation
pushdownautomata
dpda
0
votes
0
answers
8
Ace Book
The complement of the language L containing an equal number of a's , b's and c's is a)regular b)context free c)context sensitive but not context free d)recursive and not a CFL
asked
Oct 21
in
Theory of Computation
by
abhishek1995_cse
(
159
points)

38
views
contextfreelanguage
pushdownautomata
contextsensitive
0
votes
0
answers
9
Pushdown Automata
asked
Oct 19
in
Theory of Computation
by
Sambhrant Maurya
Junior
(
947
points)

61
views
pushdownautomata
theoryofcomputation
dpda
0
votes
0
answers
10
Context Free Grammar
Consider the following CFG 'G' S> aA/bSS/SS A> aAb/bAa/AA/ε The language generated by G is: a)Set of all strings with atleast one 'a' b)Set of all strings with atleast two a's c)Set of all strings with atleast one more 'a' than number of b's d)None of these
asked
Oct 18
in
Theory of Computation
by
Sambhrant Maurya
Junior
(
947
points)

34
views
theoryofcomputation
contextfreegrammars
contextfreelanguage
cfg
pushdownautomata
0
votes
0
answers
11
CFL with Empty Stack or Final State
$1)$"We can solve same PDA with empty stack and using final state" Can give an example of such language? Where is the difference between solving a pda with empty stak and by accepting final state? I got this link but without ... acceptancebyemptystackandfinalstate $2)$If language has prefix property, why it cannot be solved with empty stack?
asked
Oct 4
in
Theory of Computation
by
srestha
Veteran
(
103k
points)

82
views
theoryofcomputation
contextfreelanguage
pushdownautomata
0
votes
0
answers
12
Self doubt Pushdown Automata
Is it required to initialize stack symbol in PDA? If yes then does this PDA have valid transitions?
asked
Sep 20
in
Theory of Computation
by
Mk Utkarsh
Boss
(
29.2k
points)

14
views
pushdownautomata
theoryofcomputation
0
votes
1
answer
13
Pushdown automata
L={ai bj  i ≠ 2j+1} please give PDA for this language
asked
Sep 16
in
Theory of Computation
by
sanju77767
(
275
points)

40
views
pushdownautomata
+1
vote
0
answers
14
Michael sipser
I read this excerpt from sipser book We write a,b → c to signify that when the machine is reading an a from the input, it may replace the symbol b on the top of the stack with a c. Any of a, b, and c may be ε. If a is ε, the machine ... using any stack symbol as written here that top of stack might be epsilon if we don't want to consume it. If someone can clear my doubt. Thanks
asked
Sep 15
in
Theory of Computation
by
sushmita
Boss
(
15.2k
points)

12
views
theoryofcomputation
contextfreelanguage
pushdownautomata
0
votes
0
answers
15
Push down automata
Consider following PDA WHICH OF FOLLOWING IS TRUE ABOUT LANGUAGE ACCEPTED BY IT ? A. Regular but infinite B. Regular but finite C. DCFL but not regular D. CFL but not DCFL
asked
Sep 9
in
Theory of Computation
by
Na462
Loyal
(
7.4k
points)

61
views
theoryofcomputation
pushdownautomata
0
votes
0
answers
16
self doubt
Consider the Context free language which has equal no of as and bs. eg abab Since a proper prefix ab also belongs to this language, this language does not satisfy prefix property as far as i understand. But we can clearly draw a deterministic PDA ... with empty stack for CFL without prefix property. But above example forms a contradiction. Please resolve my doubt. I am getting confused.
asked
Sep 8
in
Theory of Computation
by
sushmita
Boss
(
15.2k
points)

56
views
theoryofcomputation
contextfreelanguage
pushdownautomata
0
votes
0
answers
17
Push Down Automata
Consider A given PDA as following Qo is the start state here. What is the language accepted by the given PDA ? 1. { ( bn a bn a )m  m,n ≥ 0 } 2. { ( bn a bn a )m  m,n ≥ 0 } U { bn  n ≥ 1} 3. { ( bn a bn )m . a  m,n ≥ 0 } 4. None
asked
Sep 5
in
Theory of Computation
by
Na462
Loyal
(
7.4k
points)

59
views
theoryofcomputation
pushdownautomata
0
votes
1
answer
18
PDADoubt
what is the DPDA for L=$a^{2n+1}b^n$  n>1
asked
Sep 3
in
Theory of Computation
by
aditi19
Active
(
2k
points)

132
views
pushdownautomata
0
votes
0
answers
19
PDADoubt
L=$a^mb^n$  m!=n is the following DPDA correct for the mentioned language?
asked
Sep 3
in
Theory of Computation
by
aditi19
Active
(
2k
points)

26
views
pushdownautomata
contextfreelanguage
0
votes
0
answers
20
DoubtPDA
what is the PDA for {L=$a^mb^n$ m>n}
asked
Sep 2
in
Theory of Computation
by
aditi19
Active
(
2k
points)

76
views
pushdownautomata
theoryofcomputation
contextfreelanguage
0
votes
0
answers
21
Parsing
For a grammar to be LR(k), it should have a PDA? Like a DPDA or just PDA in general?
asked
Aug 31
in
Compiler Design
by
Mizuki
Active
(
1k
points)

44
views
compilerdesign
parsing
contextfreelanguage
pushdownautomata
theoryofcomputation
0
votes
1
answer
22
testbook test
Doubt 1: according to me L1 should be subset of L2. But answer is d) L1,L2,L3 are incomparable. Please explain this question to me Doubt 2: which type of language is L4?
asked
Aug 12
in
Theory of Computation
by
Ananya Jaiswal 1
Active
(
2.1k
points)

40
views
testbooktestseries
theoryofcomputation
pushdownautomata
0
votes
0
answers
23
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.
asked
Jul 28
in
Theory of Computation
by
Matrix
(
67
points)

72
views
theoryofcomputation
pushdownautomata
contextfreelanguage
dpda
0
votes
1
answer
24
UGCNETJuly2018II33
A pushdown automata behaves like a Turing machine when the number of auxiliary memory is 0 1 1 or more 2 or more
asked
Jul 13
in
Theory of Computation
by
Pooja Khatri
Active
(
5.1k
points)

102
views
ugcnetjuly2018ii
theoryofcomputation
pushdownautomata
0
votes
2
answers
25
UGCNETJuly2018II34
Pushdown automata can recognize language generated by _______ Only context free grammar Only regular grammar Context free grammar or regular grammar Only context sensitive grammar
asked
Jul 13
in
Theory of Computation
by
Pooja Khatri
Active
(
5.1k
points)

171
views
ugcnetjuly2018ii
theoryofcomputation
pushdownautomata
0
votes
1
answer
26
UGC NET JULY 2018 Q34
asked
Jul 11
in
Theory of Computation
by
Sanjay Sharma
Boss
(
49.9k
points)

131
views
push
down
pushdownautomata
0
votes
0
answers
27
PDA Doubt
Please can anyone explain the PDA for reverse of a string via a transition graph
asked
Jun 29
in
Theory of Computation
by
Devshree Dubey
Boss
(
13.6k
points)

61
views
pushdownautomata
theoryofcomputation
+3
votes
1
answer
28
DCFL or Not
$\left \{ a^{m+n}b^{m+n}c^{n}m,n\geq 1 \right \}$ $\left \{ a^{m+n}b^{m+n}c^{k} m,n,k\geq 1\right \}$ $\left \{ a^{m+n}b^{m+k}c^{n+k} m,n,k\geq 1\right \}$ Which one DCFL, CFL or CSL?
asked
Jun 22
in
Theory of Computation
by
srestha
Veteran
(
103k
points)

221
views
theoryofcomputation
dcfl
contextfreelanguages
pushdownautomata
+1
vote
0
answers
29
Pda Automata
Why only stack data structure is used for implementing pushdown automata(pda) why not others ???
asked
Jun 3
in
Theory of Computation
by
vijju532
Junior
(
653
points)

37
views
theoryofcomputation
pushdownautomata
Page:
1
2
3
4
5
next »
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
IIT HYDERABAD M.Tech (RA) 3Years Winter Session Interview experience
INDIAN AIR FORCE
GATE BOOK _ TEST SERIES DOUBT_
Visualizing complex C code
GATE Book Test Series
Follow @csegate
Gatecse
Recent questions tagged pushdownautomata
Recent Blog Comments
@
44,054
questions
49,578
answers
162,837
comments
65,775
users