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 pushdown-automata
0
votes
0
answers
91
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
537
views
theory-of-computation
pushdown-automata
dpda
0
votes
0
answers
92
Draw PDA for this
L = {a^m b^n c^k=m+n } | m >= 0 and n >= 0 ---------------------- Please draw PDA for this Language!
Guilherme Zanini Mor
asked
in
Theory of Computation
Dec 12, 2018
by
Guilherme Zanini Mor
528
views
theory-of-computation
pushdown-automata
context-free-language
dcfl
0
votes
0
answers
93
MadeEasy Subject Test 2019: Theory Of Computation - Pushdown Automata
Options: $\left \{ \left ( b^{n}ab^{n}a\right )^{m} | n,m \geq 0 \right \}$ $\left \{ \left ( b^{n}ab^{n}a\right )^{m} | n,m \geq 0 \right \} \cup \left \{ b^{n} | n\geq 0 \right \}$ $\left \{ \left ( b^{n}ab^{n}\right )^{m}a | n,m \geq 0 \right \}$ $NONE$
jatin khachane 1
asked
in
Theory of Computation
Dec 10, 2018
by
jatin khachane 1
917
views
made-easy-test-series
theory-of-computation
pushdown-automata
0
votes
0
answers
94
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}
Satbir
asked
in
Theory of Computation
Dec 10, 2018
by
Satbir
446
views
pushdown-automata
theory-of-computation
0
votes
0
answers
95
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
Shivshankar
asked
in
Theory of Computation
Dec 8, 2018
by
Shivshankar
601
views
theory-of-computation
pushdown-automata
0
votes
1
answer
96
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)
rahuljai
asked
in
Theory of Computation
Nov 30, 2018
by
rahuljai
597
views
pushdown-automata
theory-of-computation
context-free-language
grammar
context-free-grammar
0
votes
1
answer
97
How to draw PDA For following language
radha gogia
asked
in
Theory of Computation
Nov 26, 2018
by
radha gogia
1.1k
views
pushdown-automata
theory-of-computation
0
votes
0
answers
98
Important doubt in TOC
Can someone please explain how and what above PDA is computing
Pavan Shetty
asked
in
Theory of Computation
Nov 17, 2018
by
Pavan Shetty
248
views
theory-of-computation
pushdown-automata
0
votes
1
answer
99
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
717
views
theory-of-computation
pushdown-automata
dpda
context-free-grammar
0
votes
2
answers
100
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
1.2k
views
theory-of-computation
pushdown-automata
dpda
0
votes
0
answers
101
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
abhishek1995_cse
asked
in
Theory of Computation
Oct 21, 2018
by
abhishek1995_cse
538
views
context-free-language
pushdown-automata
context-sensitive
0
votes
0
answers
102
Pushdown Automata
Sambhrant Maurya
asked
in
Theory of Computation
Oct 19, 2018
by
Sambhrant Maurya
744
views
pushdown-automata
theory-of-computation
dpda
2
votes
2
answers
103
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
Sambhrant Maurya
asked
in
Theory of Computation
Oct 18, 2018
by
Sambhrant Maurya
928
views
theory-of-computation
context-free-grammar
context-free-language
pushdown-automata
0
votes
0
answers
104
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 ... -acceptance-by-empty-stack-and-final-state $2)$If language has prefix property, why it cannot be solved with empty stack?
srestha
asked
in
Theory of Computation
Oct 4, 2018
by
srestha
1.5k
views
theory-of-computation
context-free-language
pushdown-automata
0
votes
0
answers
105
Self doubt Pushdown Automata
Is it required to initialize stack symbol in PDA? If yes then does this PDA have valid transitions?
Mk Utkarsh
asked
in
Theory of Computation
Sep 20, 2018
by
Mk Utkarsh
190
views
pushdown-automata
theory-of-computation
0
votes
1
answer
106
Testbook Test Series: Theory of Computation - Pushdown Automata
$\overline{L(M)}$ is Regular DCFL but not regular CFL but not DCFL Recursive but not CFL
Mk Utkarsh
asked
in
Theory of Computation
Sep 19, 2018
by
Mk Utkarsh
817
views
theory-of-computation
pushdown-automata
testbook-test-series
0
votes
1
answer
107
Pushdown automata
L={ai bj | i ≠ 2j+1} please give PDA for this language
sanju77767
asked
in
Theory of Computation
Sep 16, 2018
by
sanju77767
419
views
pushdown-automata
1
vote
0
answers
108
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 ... 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
sushmita
asked
in
Theory of Computation
Sep 15, 2018
by
sushmita
293
views
theory-of-computation
context-free-language
pushdown-automata
0
votes
0
answers
109
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
Na462
asked
in
Theory of Computation
Sep 9, 2018
by
Na462
657
views
theory-of-computation
pushdown-automata
0
votes
0
answers
110
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.
sushmita
asked
in
Theory of Computation
Sep 8, 2018
by
sushmita
633
views
theory-of-computation
context-free-language
pushdown-automata
0
votes
0
answers
111
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
Na462
asked
in
Theory of Computation
Sep 5, 2018
by
Na462
988
views
theory-of-computation
pushdown-automata
1
vote
1
answer
112
PDA-Doubt
what is the DPDA for L=$a^{2n+1}b^n$ | n>1
aditi19
asked
in
Theory of Computation
Sep 3, 2018
by
aditi19
2.0k
views
pushdown-automata
0
votes
0
answers
113
PDA-Doubt
L=$a^mb^n$ | m!=n is the following DPDA correct for the mentioned language?
aditi19
asked
in
Theory of Computation
Sep 3, 2018
by
aditi19
303
views
pushdown-automata
context-free-language
0
votes
0
answers
114
Doubt-PDA
what is the PDA for {L=$a^mb^n$ |m>n}
aditi19
asked
in
Theory of Computation
Sep 2, 2018
by
aditi19
996
views
pushdown-automata
theory-of-computation
context-free-language
0
votes
1
answer
115
Parsing
For a grammar to be LR(k), it should have a PDA? Like a DPDA or just PDA in general?
Mizuki
asked
in
Compiler Design
Aug 31, 2018
by
Mizuki
465
views
compiler-design
parsing
context-free-language
pushdown-automata
theory-of-computation
1
vote
0
answers
116
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.5k
views
theory-of-computation
pushdown-automata
context-free-language
dpda
0
votes
6
answers
117
UGC NET CSE | July 2018 | Part 2 | Question: 33
A pushdown automata behaves like a Turing machine when the number of auxiliary memory is 0 1 1 or more 2 or more
Pooja Khatri
asked
in
Theory of Computation
Jul 13, 2018
by
Pooja Khatri
2.4k
views
ugcnetcse-july2018-paper2
theory-of-computation
pushdown-automata
0
votes
3
answers
118
UGC NET CSE | July 2018 | Part 2 | Question: 34
Pushdown automata can recognize language generated by _______ Only context free grammar Only regular grammar Context free grammar or regular grammar Only context sensitive grammar
Pooja Khatri
asked
in
Theory of Computation
Jul 13, 2018
by
Pooja Khatri
3.2k
views
ugcnetcse-july2018-paper2
theory-of-computation
pushdown-automata
0
votes
0
answers
119
PDA Doubt
Please can anyone explain the PDA for reverse of a string via a transition graph
Devshree Dubey
asked
in
Theory of Computation
Jun 28, 2018
by
Devshree Dubey
726
views
pushdown-automata
theory-of-computation
4
votes
2
answers
120
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?
srestha
asked
in
Theory of Computation
Jun 22, 2018
by
srestha
1.6k
views
theory-of-computation
dcfl
context-free-language
pushdown-automata
Page:
« prev
1
2
3
4
5
6
7
8
next »
Subscribe to GATE CSE 2024 Test Series
Subscribe to GO Classes for GATE CSE 2024
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
Post GATE 2024 Guidance [Counseling tips and resources]
GATE CSE 2024 Result Responses
[Project Contest] Pytorch backend support for MLCommons Cpp Inference implementation
Participating in MLCommons Inference v4.0 submission (deadline is February 23 12pm IST)
IIITH PGEE 2024 Test Series by GO Classes
Subjects
All categories
General Aptitude
(3.5k)
Engineering Mathematics
(10.4k)
Digital Logic
(3.6k)
Programming and DS
(6.2k)
Algorithms
(4.8k)
Theory of Computation
(6.9k)
Compiler Design
(2.5k)
Operating System
(5.2k)
Databases
(4.8k)
CO and Architecture
(4.0k)
Computer Networks
(4.9k)
Artificial Intelligence
(79)
Machine Learning
(48)
Data Mining and Warehousing
(25)
Non GATE
(1.4k)
Others
(2.7k)
Admissions
(684)
Exam Queries
(1.6k)
Tier 1 Placement Questions
(17)
Job Queries
(80)
Projects
(11)
Unknown Category
(870)
64.3k
questions
77.9k
answers
244k
comments
80.0k
users
Recent questions tagged pushdown-automata
Recent Blog Comments
category ?
Hi @Arjun sir, I have obtained a score of 591 in ...
download here
Can you please tell about IIT-H mtech CSE self...
Please add your admission queries here:...