Register

Recent questions tagged pushdown-automata

0 votes
0 answers
91
Draw PDA for this
L = { a^m b^n c^k=m+n } Please draw PDA for this Language!
L = { a^m b^n c^k=m+n } Please draw PDA for this Language!
User Avatar
0 votes
0 answers
94
pda doubt
Consider the following PDA: The language accepted by the given PDA is: L = {(b^n a b^n a )^m | m, n >= 0} L = {b^n a b^n a | n >= 0} {bn | n >= 0} L = {b^n a b^n a | n >= 0} L = {(b^n a b^n a )^m | m, n >= 0} {bn | n >= 0}
Consider the following PDA:The language accepted by the given PDA is: L = {(b^n a b^n a )^m | m, n >= 0} L = {b^n a b^n a | n >= 0} {bn | n >= 0} L = {b^n a b^n a | n >= ...
User Avatar
0 votes
0 answers
95
PDA toc
Plz tell me answer of the below question In automaton theory ,a PDA is a variation of: 1)finite automaton that can make use of a stack containing data 2)infinite automaton that can make use of a stack containing data 3)both A and B 4)none of the above
Plz tell me answer of the below questionIn automaton theory ,a PDA is a variation of:1)finite automaton that can make use of a stack containing data2)infinite automaton t...
User Avatar
0 votes
0 answers
98
Important doubt in TOC
Can someone please explain how and what above PDA is computing
Can someone please explain how and what above PDA is computing
User Avatar
0 votes
1 answer
99
Push Down Automata
Consider Ldf set all languages accepted by DPDA by final state,Lef set of all languages accepted by DPDA by Empty stack Then A)Ldf proper subset of Lef. B)Ldf = Lef. C)Lef proper subset of Ldf. D)None .
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 ...
User Avatar
0 votes
2 answers
100
Pushdown Automata
Among Deterministic pushdown automata and Non deterministic pushdown automata, which is more powerful and why ?
Among Deterministic pushdown automata and Non deterministic pushdown automata, which is more powerful and why ?
User Avatar
0 votes
0 answers
101
Ace Book
The complement of the language L containing an equal number of a's , b's and c's is a)regular b)context free c)context sensitive but not context free d)recursive and not a CFL
The complement of the language L containing an equal number of a's , b's and c's isa)regularb)context freec)context sensitive but not context freed)recursive and not a CF...
User Avatar
0 votes
0 answers
105
Self doubt Pushdown Automata
Is it required to initialize stack symbol in PDA? If yes then does this PDA have valid transitions?
Is it required to initialize stack symbol in PDA?If yes then does this PDA have valid transitions?
User Avatar
0 votes
1 answer
107
Pushdown automata
L={ai bj | i ≠ 2j+1} please give PDA for this language
L={ai bj | i ≠ 2j+1}please give PDA for this language
User Avatar
0 votes
0 answers
109
Push down automata
Consider following PDA WHICH OF FOLLOWING IS TRUE ABOUT LANGUAGE ACCEPTED BY IT ? A. Regular but infinite B. Regular but finite C. DCFL but not regular D. CFL but not DCFL
Consider following PDA WHICH OF FOLLOWING IS TRUE ABOUT LANGUAGE ACCEPTED BY IT ?A. Regular but infiniteB. Regular but finiteC. DCFL but not regularD. CFL but not DCFL
User Avatar
0 votes
0 answers
111
Push Down Automata
Consider A given PDA as following Qo is the start state here. What is the language accepted by the given PDA ? 1. { ( bn a bn a )m | m,n ≥ 0 } 2. { ( bn a bn a )m | m,n ≥ 0 } U { bn | n ≥ 1} 3. { ( bn a bn )m . a | m,n ≥ 0 } 4. None
Consider A given PDA as following Qo is the start state here. What is the language accepted by the given PDA ?1. { ( bn a bn a )m | m,n ≥ 0 }2. { ( bn a bn a )m | m,n ...
User Avatar
1 votes
1 answer
112
PDA-Doubt
what is the DPDA for L=$a^{2n+1}b^n$ | n>1
what is the DPDA for L=$a^{2n+1}b^n$ | n>1
User Avatar
0 votes
0 answers
113
PDA-Doubt
L=$a^mb^n$ | m!=n is the following DPDA correct for the mentioned language?
L=$a^mb^n$ | m!=nis the following DPDA correct for the mentioned language?
User Avatar
0 votes
0 answers
114
Doubt-PDA
what is the PDA for {L=$a^mb^n$ |m>n}
what is the PDA for {L=$a^mb^n$ |m>n}
User Avatar
0 votes
1 answer
115
Parsing
For a grammar to be LR(k), it should have a PDA? Like a DPDA or just PDA in general?
For a grammar to be LR(k), it should have a PDA? Like a DPDA or just PDA in general?
User Avatar
1 votes
0 answers
116
DPDA acceptance by empty stack
Is this approach of acceptance by empty stack correct ? I am confused because i have read that acceptance by empty stack may not be able to accept all regular languages.
Is this approach of acceptance by empty stack correct ?I am confused because i have read that acceptance by empty stack may not be able to accept all regular languages.
User Avatar
0 votes
3 answers
118
UGC NET CSE | July 2018 | Part 2 | Question: 34
Pushdown automata can recognize language generated by _______ Only context free grammar Only regular grammar Context free grammar or regular grammar Only context sensitive grammar
Pushdown automata can recognize language generated by _______Only context free grammarOnly regular grammarContext free grammar or regular grammarOnly context sensitive gr...
User Avatar
0 votes
0 answers
119
PDA Doubt
Please can anyone explain the PDA for reverse of a string via a transition graph
Please can anyone explain the PDA for reverse of a string via a transition graph
User Avatar
4 votes
2 answers
120
DCFL or Not
$\left \{ a^{m+n}b^{m+n}c^{n}|m,n\geq 1 \right \}$ $\left \{ a^{m+n}b^{m+n}c^{k} |m,n,k\geq 1\right \}$ $\left \{ a^{m+n}b^{m+k}c^{n+k} |m,n,k\geq 1\right \}$ Which one DCFL, CFL or CSL?
$\left \{ a^{m+n}b^{m+n}c^{n}|m,n\geq 1 \right \}$$\left \{ a^{m+n}b^{m+n}c^{k} |m,n,k\geq 1\right \}$$\left \{ a^{m+n}b^{m+k}c^{n+k} |m,n,k\geq 1\right \}$Which one DCFL...
User Avatar
Page: