CS-2002 Question Paper With Solutions

Q. 7 The language accepted by a Pushdown Automation in which the stack is limited to 10 items is best described as

(A) Context Free

(B) Regular

(C) Deterministic Context Free

(D) Recursive

Answer: (B)

Explanation:

CS-2002 Question Paper With Solutions

Learn More:   Gate CS-2012 Question Paper With Solutions

LEAVE A REPLY

Please enter your comment!
Please enter your name here