Question Discussion & Solution

A machine configuration is an element of K

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.

A Deterministic Push Down Automata is a Push Down Automata in which no state p has two or more transitions.