New answers tagged pushdown-automata
0
votes
CFGs and Pushdown Automata
As you noticed, the CFG you have given accepts words not in the language $L$. Therefore, no, it is not correct. We will not do your homework for you, but I will give you the hint that your current CFG ...
0
votes
Constructing a PDA for the language $\{a^mb^n | m > n\}$
According to me if no. of a's is greater than no. Of b's and once the pushing of string a is completed in the stack then we start popping out every a for every b we get,then at last more than 1 no. Of ...
Top 50 recent answers are included
Related Tags
pushdown-automata × 542context-free × 238
automata × 229
formal-languages × 159
finite-automata × 59
formal-grammars × 45
turing-machines × 40
nondeterminism × 38
regular-languages × 36
computability × 27
closure-properties × 19
pumping-lemma × 15
computation-models × 15
simulation × 13
undecidability × 9
parsers × 9
complexity-theory × 8
halting-problem × 7
stacks × 6
context-sensitive × 6
reference-request × 5
regular-expressions × 5
algorithms × 4
terminology × 4
proof-techniques × 4