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

(A) Regular
(B) Deterministic context free
(C) Context free
(D) Recursive

💬 Discuss

✅ Correct Answer: (A) Regular

Published by Mr. Dubey ⭐ 109.71K Points at 18-Sep-2023 04:33 pm in Theory of Computation

You must be Logged in to update hint/solution

💬 Discussion

📊 Question Analytics

👁️

1047

Total Visits

📽️

3 y ago

Published

🎖️

Mr. Dubey

Publisher

📈

97%

Success Rate