STQC-NIELIT STA 2021
March 18, 2025GATE 2002
March 19, 2025GATE 2002
|
Question 7
|
The language accepted by a Pushdown Automaton in which the stack is limited to 10 items is best described as
|
Context free
|
|
|
Regular
|
|
|
Deterministic Context free
|
|
|
Recursive
|
Question 7 Explanation:
Push down automata accept context free grammars but here the value of stack is limited 10 then it accepts regular languages.
Correct Answer: B
Question 7 Explanation:
Push down automata accept context free grammars but here the value of stack is limited 10 then it accepts regular languages.