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
2
answers
181
dpda }} Linz7.3-4
DPDA for $L = \left \{ a^nb^n:n\geq 1 \right \} \cup\left \{ a \right \}$
dd
asked
in
Theory of Computation
Dec 7, 2016
by
dd
755
views
pushdown-automata
theory-of-computation
0
votes
2
answers
182
dpda || Linz 7.3-2
DPDA for $L = \left \{ a^nb^m|m\geq n+2 \right \}$
dd
asked
in
Theory of Computation
Dec 7, 2016
by
dd
468
views
theory-of-computation
pushdown-automata
1
vote
1
answer
183
cfg pda toc
how $a^nb^nc^n$ n>=1 is not CFL....??
Anmol Verma
asked
in
Theory of Computation
Dec 2, 2016
by
Anmol Verma
897
views
theory-of-computation
context-free-language
grammar
context-free-grammar
pushdown-automata
0
votes
0
answers
184
Construction of PDA
Can someone construct a PDA for ai bj where i not equal to 3j+1 ? Is it NPDA or DPDA?
Xylene
asked
in
Theory of Computation
Nov 24, 2016
by
Xylene
473
views
pushdown-automata
theory-of-computation
minimal-state-automata
context-free-language
2
votes
1
answer
185
Language Accepted By PDA
Please Explain why the following is accpeted/rejected by PDA . ( Need detail explanation ) S1 = { 0n 0m 1n 0m | n,m>0 } S2 = { 0n 0m 1n 1m 0m | n,m>0 } S3 = { am 0m 1n 1n | n,m>0} S4 = { am 0n 1n 1m | n,m>0}
Anjana Babu
asked
in
Theory of Computation
Nov 24, 2016
by
Anjana Babu
1.7k
views
theory-of-computation
pushdown-automata
context-free-language
1
vote
2
answers
186
PDA construction
Is the following language context free L = {$0^{i}1^{j}, i=2j+1$} How can PDA be designed for this language?
Rakesh K
asked
in
Theory of Computation
Nov 18, 2016
by
Rakesh K
1.6k
views
pushdown-automata
context-free-language
0
votes
1
answer
187
Equivalency of diffetent automata
Write about the equivalency of different automata such as DFA, NFA, DPDA, NPDA, DTM, NTM. Which automata or machine can be converted to other machines and why? For example NFA can be converted to DFA, DPDA, NPDA, DTM, NTM.
Geet
asked
in
Theory of Computation
Nov 1, 2016
by
Geet
534
views
finite-automata
pushdown-automata
turing-machine
4
votes
2
answers
188
Doubts
$a^{2n}b^n$ $a^nb^m, m\leq n\leq 3m$ $a^nb^m , n=4m$ Which of the following is CFL ?
Rahul Jain25
asked
in
Theory of Computation
Oct 20, 2016
by
Rahul Jain25
3.9k
views
theory-of-computation
context-free-language
pushdown-automata
1
vote
1
answer
189
TOC-PDA
IS one state sufficient for an empty stack PDA? Needs explanation !
Aboveallplayer
asked
in
Theory of Computation
Aug 2, 2016
by
Aboveallplayer
580
views
pushdown-automata
2
votes
2
answers
190
UGC NET CSE | December 2014 | Part 3 | Question: 22
The pushdown automation $M=(\left\{q_{0}, q_{1}, q_{2}\right\}, \left\{a, b\right\}, \left\{0, 1\right\}, \delta, q_{0}, 0, \left\{q_{0}\right\})$ with $\delta (q_{0}, a, 0)= \left\{(q_{1}, 10)\right\}$ ... $L=\left\{a^{n}b^{m} | n, m > 0\right\}$ $L=\left\{a^{n}b^{n} | n > 0\right\}$
makhdoom ghaya
asked
in
Theory of Computation
Jul 27, 2016
by
makhdoom ghaya
2.4k
views
ugcnetcse-dec2014-paper3
theory-of-computation
pushdown-automata
1
vote
0
answers
191
UGC NET CSE | September 2013 | Part 3 | Question: 22
Non-deterministic pushdown automaton that accepts the language generated by the grammar: $S \rightarrow aSS \mid ab$ ...
go_editor
asked
in
Theory of Computation
Jul 22, 2016
by
go_editor
978
views
ugcnetcse-sep2013-paper3
theory-of-computation
pushdown-automata
2
votes
1
answer
192
NPDA
How much memory does npda takes or has? As when we are taking npda for let's say ww^r.. Then we will be considering two pda at the same time.. Is it practical or theoretical.. Whts the case?
Chetnawadhwa
asked
in
Theory of Computation
Jul 19, 2016
by
Chetnawadhwa
1.3k
views
pushdown-automata
theory-of-computation
2
votes
1
answer
193
UGC NET CSE | June 2013 | Part 3 | Question: 37
A pushdown automation $M=(Q, \Sigma, \Gamma, \delta , q_0, z, F)$ is set to be deterministic subject to which of the following condition(s), for every $q \in Q, a \in \Sigma \cup \{\lambda\} \text{ and } b \in \Gamma$ ... empty then $\delta(q, c, b)$ must be empty for every $c \in \Sigma$ only s1 only s2 both s1 and s2 neither s1 nor s2
go_editor
asked
in
Theory of Computation
Jul 17, 2016
by
go_editor
1.5k
views
ugcnetcse-june2013-paper3
theory-of-computation
pushdown-automata
1
vote
1
answer
194
Pushdown automata
For every pushdown automata,there exists an equivalent A)Regular Language B)Context sensitive language C)Context free language D)Recursively Enumerable language.
vivekpinto07
asked
in
Theory of Computation
Jul 6, 2016
by
vivekpinto07
2.1k
views
theory-of-computation
pushdown-automata
2
votes
2
answers
195
push down automata
The pushdown automation $M=(\{q_0, q_1, q_2\}, \{a,b\}, \{0,1\}, \delta, q_0, 0, \{q_0\})$ with $\delta(q_0,a,0)=\{q_1,10)\}$ $\delta(q_1,a,1)=\{q_1,11)\}$ $\delta(q_0,b,1)=\{q_2,\lambda)\}$ $\delta(q_2,b,1)=\{q_2,\lambda)\}$ $\delta(q_2,\lambda,0)=\{q_0,\lambda)\}$ Accepts ... $L=\{a^nb^n \mid n \geq 0\}$ $L=\{a^nb^m \mid n,m > 0\}$ $L=\{a^nb^n \mid n > 0\}$
Sanjay Sharma
asked
in
Theory of Computation
Jun 30, 2016
by
Sanjay Sharma
5.5k
views
theory-of-computation
pushdown-automata
0
votes
1
answer
196
Pushdown automation
A language L is accepted by a pushdown automation if and only if it is A) Context Sensitive B)Recursive C)Context Free D)Right Linear
vivekpinto07
asked
in
Theory of Computation
Jun 24, 2016
by
vivekpinto07
1.4k
views
theory-of-computation
pushdown-automata
0
votes
1
answer
197
SHUFFLE PROPERTY OVER REGULAR LANGUAGES
The shuffle of two strings w and x is the set of all strings that one can get by interleaving the positions of w and x in any way.More precisely,shuffle(w,x) is the set of strings z such that 1)Each position of z canbe assigned to w ... {01110,01101,10110,01011,11001,11010}. Q) Show that if L1 and L2 are both regular languages,then so is shuffle(L1,L2)
Santhosh Devulapally
asked
in
Theory of Computation
Jun 20, 2016
by
Santhosh Devulapally
1.2k
views
pushdown-automata
0
votes
1
answer
198
DESIGN PDA
THE SET OF ALL STRINGS OF a's and b's THAT ARE NOT OF THE FORM ww, i.e., NOT EQUAL TO ANY STRING REPEATED
Santhosh Devulapally
asked
in
Theory of Computation
Jun 20, 2016
by
Santhosh Devulapally
2.8k
views
pushdown-automata
0
votes
1
answer
199
TOC , Language ,PDA
What does this Language Represents ? And what is the machine which is able to represent this Language. L = { a^i b^j c^k d^l } where i = k or j = l How it is different from L = {a^m b^n c^m d^n}
shekhar chauhan
asked
in
Theory of Computation
Jun 15, 2016
by
shekhar chauhan
2.2k
views
theory-of-computation
pushdown-automata
context-free-language
1
vote
2
answers
200
Automata Language PDA
If a given CFL Language is L= {a^n b^n ;n>=0} then how can we determine the value of L^2 .Explain with an example .
shekhar chauhan
asked
in
Theory of Computation
Jun 6, 2016
by
shekhar chauhan
914
views
theory-of-computation
pushdown-automata
context-free-language
3
votes
1
answer
201
Is this language be accepted by 2 stack PDA L={a^n b^m c^n d^m / n>=m}
Don't you worry
asked
in
Theory of Computation
Jun 1, 2016
by
Don't you worry
4.4k
views
theory-of-computation
context-free-language
pushdown-automata
0
votes
2
answers
202
is pushdown automata less powerful than Turing machines ?
Amit Sharma
asked
in
Theory of Computation
Jun 1, 2016
by
Amit Sharma
6.4k
views
theory-of-computation
turing-machine
pushdown-automata
5
votes
4
answers
203
Difference between DPDA and NPDA?
Amit Sharma
asked
in
Theory of Computation
Jun 1, 2016
by
Amit Sharma
38.8k
views
theory-of-computation
pushdown-automata
1
vote
3
answers
204
MadeEasy Test Series: Theory Of Computation - Pushdown Automata
Every cfg may not have equivalent pda T/F
Sourabh Kumar
asked
in
Theory of Computation
Apr 22, 2016
by
Sourabh Kumar
1.2k
views
made-easy-test-series
theory-of-computation
pushdown-automata
48
votes
6
answers
205
GATE CSE 2016 Set 1 | Question: 43
Consider the transition diagram of a PDA given below with input alphabet $\Sigma=\{a,b\}$ and stack alphabet $\Gamma = \{X,Z\}$. $Z$ is the initial stack symbol. Let $L$ ... on every input $L =\{a^n\mid n \geq0 \} \cup \{a^nb^n \mid n \geq 0\}$ and is deterministic context-free
Sandeep Singh
asked
in
Theory of Computation
Feb 12, 2016
by
Sandeep Singh
16.9k
views
gatecse-2016-set1
theory-of-computation
pushdown-automata
normal
1
vote
2
answers
206
Push down automata
Which solution is correct one? I wish I solved it correctly (sol1)
khushtak
asked
in
Theory of Computation
Jan 14, 2016
by
khushtak
1.3k
views
pushdown-automata
theory-of-computation
1
vote
0
answers
207
Output Of PDA.
bahirNaik
asked
in
Theory of Computation
Jan 3, 2016
by
bahirNaik
729
views
pushdown-automata
theory-of-computation
5
votes
4
answers
208
PDA
Consider the following push down automata. The language accepted by above PDA is_______. Regular but infinite. DCFL but not regular. CFL but not DCFL Finite language.
resuscitate
asked
in
Theory of Computation
Dec 5, 2015
by
resuscitate
2.4k
views
theory-of-computation
context-free-language
pushdown-automata
1
vote
1
answer
209
Theory of computation question
http://geeksquiz.com/gate-gate-cs-2015-set-1-question-60/ please give explanation to this question.
gaurav kumar 1
asked
in
Theory of Computation
Nov 15, 2015
by
gaurav kumar 1
766
views
theory-of-computation
pushdown-automata
0
votes
2
answers
210
how to construct pda for a^i b^j where j!=2i+1, i>=0
how to construct pda for a^i b^j where j!=2i+1, i>=0 ? i have constructed for j=2i+1 but by complementing the states do we get actual n pda of our requirement? whether it is decidable?
Ravi Raaja
asked
in
Theory of Computation
Sep 17, 2015
by
Ravi Raaja
2.2k
views
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:...