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
All Activity
Questions
Unanswered
Tags
Subjects
Users
Ask
Previous
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 npda
0
votes
0
answers
1
Existence of a 2 state NPDA
How can we convert an arbitrary NPDA into an NPDA with at most 2 states? I know the existence of a 3 state PDA, but how can it be done by using just 2 states?
asked
Jul 15
in
Theory of Computation
by
Lakshay Kakkar
Junior
(
975
points)

18
views
peterlinz
theoryofcomputation
npda
+1
vote
2
answers
2
#Test series
Q. {al bm cn  l ≠ m or m ≠ n} construct a PDA for this language?
asked
Jul 10
in
Theory of Computation
by
himgta
Active
(
1k
points)

39
views
npda
0
votes
1
answer
3
Introduction to Computer Theory
Draw PDA for ((a^m)(b^n)(a^n)(b^m)) ?
asked
Apr 13
in
Theory of Computation
by
The Capricorn
(
147
points)

54
views
theoryofcomputation
dpda
npda
+4
votes
0
answers
4
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, ...... \}$
asked
Mar 28
in
Theory of Computation
by
The Capricorn
(
147
points)

164
views
theoryofcomputation
npda
dpda
0
votes
0
answers
5
Construct a NPDA (peter linz) Exercise 7.2.6
asked
Mar 25
in
Theory of Computation
by
Mk Utkarsh
Boss
(
13.8k
points)

126
views
theoryofcomputation
peterlinz
pushdownautomata
npda
+2
votes
1
answer
6
Power of Pushdown Machines
Which is more powerful : 2way NonDeterministic Pushdown Machine(NDPDM) or 2way Deterministic Pushdown Machine(DPDM) ? (or) Do both machine models have the same power ?
asked
Mar 4
in
Theory of Computation
by
ankitgupta.1729
Loyal
(
6.5k
points)

46
views
theoryofcomputation
pushdownautomata
dpda
npda
0
votes
0
answers
7
NonDeterministic PDA
I'm getting its equaltion {anbn  n > 0} U {a} U {b} But given is {anbn  n >= 0} U {a} U {b} Whether epsilon is accepted or not??
asked
Dec 24, 2017
in
Theory of Computation
by
Ashwin Kulkarni
Boss
(
17.8k
points)

116
views
pushdownautomata
npda
theoryofcomputation
+1
vote
2
answers
8
Arrange in the increasing order of power of following automata
asked
Dec 11, 2017
in
Theory of Computation
by
Durgesh Singh
Junior
(
877
points)

125
views
theoryofcomputation
pushdownautomata
dpda
npda
+1
vote
0
answers
9
made easy test series
The language {w the length of w is odd and it's middle symbol is 0, Wε(0+1)*} Why do we need a PDA for above language. I don't think we need a PDA for this language. I wrote the following RE. Tell me whats wrong in it: [(0+1)(0+1)(0+1)]+0[(0+1)(0+1)(0+1)]+ + (other small left over strings like 0,101,100,001,000..... which are not covered in first part of expression)
asked
Nov 29, 2017
in
Theory of Computation
by
♥_Less
Junior
(
995
points)

86
views
madeeasytestseries
theoryofcomputation
dpda
npda
cfg
regularexpressions
regularlanguages
0
votes
0
answers
10
Practice question #4
Consider the machines, M1  a NPDA accepting L1, M2  a 2 way PDA accepting L2, M3  a PDA with two stacks accepting L3. Choose the false statement, 1) For any CFL L, there exists some M1, M2 and M3. 2) For some CSL L, there exists some M1,M2 and M3. 3) For every recursive set, there exists some M1,M2 and M3. 4) The power of the machines are not M1 <= M2 < M3.
asked
Sep 18, 2017
in
Theory of Computation
by
AnilGoudar
Active
(
4.5k
points)

76
views
theoryofcomputation
npda
+1
vote
1
answer
11
TOC DPDA vs NPDA
How many stacks are available with DPDA and NPDA? I assume it is 1 with DPDA and n with NPDA where n is some constant. Assume i have a language ,over alphabet a,b,c,dL=( W n(a)=n(b) and n(c)=n(d) ),where n(a) is number if a in words. It is a CFL. Now can DPA handle this ?If yes,then how?If not,then why?
asked
Jul 31, 2017
in
Theory of Computation
by
rahul sharma 5
Boss
(
24.4k
points)

520
views
pushdownautomata
npda
theoryofcomputation
contextfreelanguage
deterministiccontextfreegrammars
+1
vote
1
answer
12
Peter Linz Exercise 7.1
Q1) Given, $L1 = (aaa^*b)$ $L2 = (aab^*aba^*)$ Find the union of $L1$ and $L2$, and also find $L1  L2$. Q2) Find the npda's of the following: 1) $L = \{ a^nb^m :n \leq m \leq 3n\}$ 2) $L = \{w : 2n_a(w) \leq n_b(w)) \leq 3n_a(w) \}$.
asked
Jul 8, 2017
in
Theory of Computation
by
Shubhanshu
Boss
(
15.1k
points)

127
views
theoryofcomputation
contextfreelanguage
peterlinz
pushdownautomata
npda
pushdownautomata
0
votes
1
answer
13
NPDA and DPDA
Can we make NPDA? L= {anbn n>=0,a,b are input variables} if yes then make it .
asked
Jul 6, 2017
in
Theory of Computation
by
akankshadewangan24
Active
(
4k
points)

233
views
pushdownautomata
npda
+2
votes
0
answers
14
How to construct npda for given languages (Peter Linz 3rd Ed, Exercise 7, Ques 4)?
asked
Apr 30, 2017
in
Theory of Computation
by
Vishal Goel
Active
(
1.4k
points)

215
views
pushdownautomata
theoryofcomputation
npda
nondeterminism
peterlinz
contextfreelanguages
To see more, click for the
full list of questions
or
popular tags
.
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
Schedule for GATE 2019
GATE 2019 official website
Correct way of preparation
Right process to start solving MCQs in Comp.Sc.
UGC NET JULY 2018 Results
Follow @csegate
Gatecse
Recent questions tagged npda
Recent Blog Comments
All of you got tracking details rt? Yesterday ...
I still haven't got consignment tracking number, ...
Good
I had paid in 12th August, 2018. But did not get ...
Sunday is IndiaPost holiday (Amazon works) so you ...
37,975
questions
45,471
answers
131,383
comments
48,424
users