1,123 views

1 Answer

0 votes
0 votes

In computer science, a pushdown automaton(PDA) is a type of automaton that employs a stack. Pushdown automata are used in theories about what can be computed by machines. They are more capable than finite-state machines but less capable than Turing machines.

deterministic pushdown automaton  is a variation of the pushdown automata. The class of deterministic pushdown automata accepts the deterministic CFL a proper subset of context free language.

Related questions

0 votes
0 votes
1 answer
1
Abhisek Tiwari 4 asked Nov 6, 2018
704 views
Consider Ldf set all languages accepted by DPDA by final state,Lef set of all languages accepted by DPDA by Empty stack ThenA)Ldf proper subset of Lef.B)Ldf = Lef.C)Lef ...
0 votes
0 votes
0 answers
2
shivangi5 asked Dec 1, 2017
452 views
Consider the following statement:S: Set of languages accepted by DPDA by empty stack contain only those DCFL’s with prefix property.Please explain as why this sentence ...
0 votes
0 votes
0 answers
3
NIKU asked Sep 16, 2017
348 views
draw a deterministic PDA forambn where, m = 2n+1
0 votes
0 votes
2 answers
4
Shamim Ahmed asked Oct 25, 2018
1,154 views
Among Deterministic pushdown automata and Non deterministic pushdown automata, which is more powerful and why ?