Define for a context free language L ? {0, 1}* , init(L)={u ? uv ? L for some v in {0,1}?} ( in other words, init(L) is the set of prefixes of L) Let L = {w ? w is nonempty and has an equal number of 0
The language accepted by a Pushdown Automation in which the stack is limited to 10 items is best described as
Correct Answer: B
Pushdown automata is used for context free languages, i.e., languages in which the length of elements is unrestricted and length of one element is related to other. To resolve this problem, we use a stack with no restrictions on length.
But in the given case, length of stack is restricted. Thus, this pushdown automata can only accept languages which can also be accepted by finite state automata and a finite state automata accepts only regular languages.
Thus, B is the correct choice.
Please comment below if you find anything wrong in the above post.
