-
The language accepted by a push-down automata in which the stack is limited to 10 items is best described as
-
- context-free
- regular
- deterministic context-free
- recursive
- context-free
Correct Option: B
It is given that the stack is limited to 10 items therefore the stack function is a type of recursion. This directly implies that the language accepted by push-down automata is a regular language.
