The language accepted by a Pushdown Automaton in which the stack is limited to $10$ items is best described as
Correct Option: B With only finite positions in stack, we can have only finite configurations and these can also be modeled as states in a finite automata.
@Sachin Mittal 1,
using this approach, we will have at most 10 states, Finite State automata which generates Regular Grammar. please verify.
64.3k questions
77.9k answers
243k comments
79.6k users