New answers tagged

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 ...
NaturalLogZ's user avatar
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 ...
Abhinav Aryan's user avatar

Top 50 recent answers are included