Recent questions tagged npda

0 votes

1 answer

1

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 (133 points) | 31 views

+4 votes

0 answers

2

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 (133 points) | 153 views

0 votes

0 answers

3

Construct a NPDA (peter linz) Exercise 7.2.6

asked Mar 25 in Theory of Computation by Mk Utkarsh Boss (12.4k points) | 95 views

+2 votes

1 answer

4

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 ?

asked Mar 4 in Theory of Computation by ankitgupta.1729 Loyal (5.7k points) | 39 views

0 votes

0 answers

5

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??

asked Dec 24, 2017 in Theory of Computation by Ashwin Kulkarni Boss (17.6k points) | 99 views

+1 vote

2 answers

6

Arrange in the increasing order of power of following automata-

asked Dec 11, 2017 in Theory of Computation by Durgesh Singh Junior (877 points) | 96 views

+1 vote

0 answers

7

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 (977 points) | 77 views

0 votes

0 answers

8

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) | 70 views

+1 vote

1 answer

9

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 (23.9k points) | 491 views

+1 vote

0 answers

10

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 = { anbm : n<=m<=3n }. 2) L = {w : 2na(w) <= nb(w) <= 3na(w) }.

asked Jul 8, 2017 in Theory of Computation by Shubhanshu Boss (15k points) | 103 views

0 votes

1 answer

11

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 (3.9k points) | 209 views

+2 votes

0 answers

12

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.3k points) | 187 views

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 questions tagged npda

Recent Posts

Recent Blog Comments