Computer Science · Theory of Computation
Given below are two statements, one labelled as Assertion (A) and the other labelled as Reason (R): Assertion (A): NPDA (Non-Deterministic Pushdown Automata) and DPDA (Deterministic Pushdown Automata) are not equivalent in power. Reason (R): NPDA can accept languages that cannot be accepted by any DPDA (e.g., inherent ambiguous context-free languages or odd length palindromes). In light of the above statements, choose the correct answer from the options given below:
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 1(A) is false, but (R) is true
- 2(A) is true, but (R) is false
- 3Both (A) and (R) are true but (R) is not the correct explanation of (A)
- 4Both (A) and (R) are true and (R) is the correct explanation of (A)✓
Correct answer
Both (A) and (R) are true and (R) is the correct explanation of (A)
Download Single Question PDF
Save this question and verified answer as a clean study sheet with live clickable link.
👥
Share with Friends & Study Groups
Challenge your peer aspirants on WhatsApp or Telegram to solve this question!
Online Test Series
Start Free Mock Test →Preparing for Computer Science?
Practice full-length mock tests with real exam timers, instant score analysis, and all-India ranking.
Chapter Practice
Practice Theory of Computation MCQs →Want more practice questions on Theory of Computation?
Solve complete topic-wise tests with detailed solutions on GkGet.
Related Practice Questions
Recommended practice questions in Computer Science · Theory of Computation