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 and DPDA are not equivalent in power. Reason (R): NPDA is more powerful than DPDA and accepts deterministic context-free languages as well as non-deterministic context-free languages. Choose the correct answer from the options given below:
- 1Both (A) and (R) are true and (R) is the correct explanation of (A)✓
- 2Both (A) and (R) are true, but (R) is NOT the correct explanation of (A)
- 3(A) is true, but (R) is false
- 4(A) is false, but (R) is true
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!
Preparing for Computer Science?
Practice full-length mock tests with real exam timers, instant score analysis, and all-India ranking.
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