Q. Consider a stack, which is limited to 10 items. The language accepted by a push- down automaton in such stack is best described as (Solved)
1. Regular
2. Deterministic context free
3. Context free
4. Recursive
- a. Regular
1. Regular
2. Deterministic context free
3. Context free
4. Recursive