Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Recent questions tagged npda
1
votes
0
answers
31
Peter Linz Edition 4 Exercise 7.1 Question 3 (Page No. 183)
Construct npda's that accept the following regular languages. (a) $L_1 = L (aaa^*b)$. (b) $L_1 = L (aab^*aba^*)$. (c & d here)
Construct npda's that accept the following regular languages.(a) $L_1 = L (aaa^*b)$.(b) $L_1 = L (aab^*aba^*)$.(c & d here)
Naveen Kumar 3
628
views
Naveen Kumar 3
asked
Apr 20, 2019
Theory of Computation
peter-linz
peter-linz-edition4
theory-of-computation
pushdown-automata
npda
+
–
0
votes
0
answers
32
Peter Linz Edition 4 Exercise 7.1 Question 2 (Page No. 183)
Prove that an npda for accepting the language $L =$ { $ww^R : w ∈$ {$a, b$}$^+$ } does not accept any string not in {$ww^R$}.
Prove that an npda for accepting the language $L =$ { $ww^R : w ∈$ {$a, b$}$^+$ } does not accept any string not in {$ww^R$}.
Naveen Kumar 3
185
views
Naveen Kumar 3
asked
Apr 20, 2019
Theory of Computation
peter-linz
peter-linz-edition4
theory-of-computation
pushdown-automata
npda
+
–
0
votes
1
answer
33
TESTBOOK TEST SERIES
WHAT WILL BE THE ANS?
WHAT WILL BE THE ANS?
Avik Chowdhury
262
views
Avik Chowdhury
asked
Oct 3, 2018
Theory of Computation
npda
+
–
0
votes
0
answers
34
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?
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?
Lakshay Kakkar
229
views
Lakshay Kakkar
asked
Jul 15, 2018
Theory of Computation
peter-linz
theory-of-computation
npda
+
–
1
votes
2
answers
35
#Test series
Q. {al bm cn | l ≠ m or m ≠ n} construct a PDA for this language?
Q. {al bm cn | l ≠ m or m ≠ n} construct a PDA for this language?
himgta
277
views
himgta
asked
Jul 10, 2018
Theory of Computation
npda
+
–
0
votes
1
answer
36
Introduction to Computer Theory
Draw PDA for ((a^m)(b^n)(a^n)(b^m)) ?
Draw PDA for ((a^m)(b^n)(a^n)(b^m)) ?
The Capricorn
440
views
The Capricorn
asked
Apr 13, 2018
Theory of Computation
theory-of-computation
dpda
npda
+
–
4
votes
0
answers
37
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, ...... \}$
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=\{\...
The Capricorn
783
views
The Capricorn
asked
Mar 28, 2018
Theory of Computation
theory-of-computation
npda
dpda
+
–
0
votes
0
answers
38
Peter Linz Edition 4 Exercise 7.2 Question 6 (Page No. 195)
Construct a NPDA corresponding to the grammar. $S \rightarrow AA|a$ $A\rightarrow SA|b$ also convert the given grammar to GNF.
Construct a NPDA corresponding to the grammar.$S \rightarrow AA|a$$A\rightarrow SA|b$also convert the given grammar to GNF.
Mk Utkarsh
603
views
Mk Utkarsh
asked
Mar 25, 2018
Theory of Computation
theory-of-computation
peter-linz
peter-linz-edition4
pushdown-automata
npda
+
–
3
votes
1
answer
39
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 ?
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
706
views
ankitgupta.1729
asked
Mar 3, 2018
Theory of Computation
theory-of-computation
pushdown-automata
dpda
npda
+
–
0
votes
0
answers
40
Non-Deterministic 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??
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??
Ashwin Kulkarni
907
views
Ashwin Kulkarni
asked
Dec 24, 2017
Theory of Computation
pushdown-automata
npda
theory-of-computation
+
–
1
votes
2
answers
41
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
Realtime DPDA with Null Store,Real time DPDA with final state, DPDA with NULL store,DPDA with final state, NPDA
Durgesh Singh
2.5k
views
Durgesh Singh
asked
Dec 10, 2017
Theory of Computation
theory-of-computation
pushdown-automata
dpda
npda
+
–
0
votes
0
answers
42
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.
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 ex...
AnilGoudar
572
views
AnilGoudar
asked
Sep 18, 2017
Theory of Computation
theory-of-computation
npda
+
–
1
votes
1
answer
43
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?
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...
rahul sharma 5
2.0k
views
rahul sharma 5
asked
Jul 31, 2017
Theory of Computation
pushdown-automata
npda
theory-of-computation
context-free-language
deterministic-context-free-grammars
+
–
2
votes
1
answer
44
Peter Linz Edition 4 Exercise 7.1 Question 3.c,3.d,4.f,4.j (Page No. 183)
Q3) Given, $L_1 = (aaa^*b)$ $L_2 = (aab^*aba^*)$ Find (c) the union of $L_1$ and $L_2$, and also find (d) $L_1 - L_2$. Q4) Find the npda's of the following: f) $L = \{ a^nb^m :n \leq m \leq 3n\}$ j) $L = \{w : 2n_a(w) \leq n_b(w)) \leq 3n_a(w) \}$.
Q3) Given,$L_1 = (aaa^*b)$$L_2 = (aab^*aba^*)$Find (c) the union of $L_1$ and $L_2$, and also find (d) $L_1 - L_2$.Q4) Find the npda's of the following:f) $L = \{ a^nb^m...
Shubhanshu
1.9k
views
Shubhanshu
asked
Jul 8, 2017
Theory of Computation
theory-of-computation
context-free-language
peter-linz
peter-linz-edition4
pushdown-automata
npda
+
–
0
votes
2
answers
45
NPDA and DPDA
Can we make NPDA? L= {anbn| n>=0,a,b are input variables} if yes then make it .
Can we make NPDA? L= {anbn| n>=0,a,b are input variables}if yes then make it .
akankshadewangan24
2.5k
views
akankshadewangan24
asked
Jul 6, 2017
Theory of Computation
pushdown-automata
npda
+
–
4
votes
1
answer
46
Peter Linz Edition 4 Exercise 7.1 Question 4.h(Page No. 183)
Construct npda for the following languages on $∑ =$ {$a,b,c$} $L =$ { $w : n_a(w) = 2*n_b(w)$ }
Construct npda for the following languages on $∑ =$ {$a,b,c$} $L =$ { $w : n_a(w) = 2*n_b(w)$ }
Vishal Goel
1.9k
views
Vishal Goel
asked
Apr 30, 2017
Theory of Computation
peter-linz
peter-linz-edition4
theory-of-computation
pushdown-automata
npda
+
–
Page:
« prev
1
2
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register