DPDA NPDA DCFL CFL

There are two possible acceptance criteria: acceptance by empty stack and acceptance by final state. The two are not equivalent for the deterministic pushdown automaton (...

himgta

4.2k views

himgta asked Oct 4, 2018

1 votes

1 answer

rahul sharma 5 asked Jul 31, 2017

1,955 views

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

+ –

0 votes

2 answers

akankshadewangan24 asked Jul 6, 2017

2,491 views

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

+ –

5 votes

4 answers

Amit Sharma asked Jun 1, 2016

38,965 views

Difference between DPDA and NPDA?

Amit Sharma

39.0k views

Amit Sharma asked Jun 1, 2016

Theory of Computation
theory-of-computation
pushdown-automata

+ –

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

2 2 Comments reply

Please log in or register to add a comment.

Please log in or register to answer this question.

0 Answers

Related questions

2 2 Comments