0 votes 0 votes Which of the following is not true ? Power of deterministic automata is equivalent to power of non-deterministic automata Power of deterministic pushdown automata is equivalent to power of non-deterministic pushdown automata Power of deterministic turing machine is equivalent to power of non-deterministic turing machine All the above Others ugcnetcse-june2005-paper2 + – go_editor asked Mar 26, 2020 • edited Jun 11, 2020 by soujanyareddy13 go_editor 3.5k views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes Answer: B. Power of deterministic pushdown automata is equivalent to power of non-deterministic pushdown automata. The above statement is incorrect. iamrohit answered Mar 26, 2020 iamrohit comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes Option B is correct here. PDA is by default NPDA and the expressive power of NPDA is more than DPDA. NPDA accept more number of language than DPDA. so they are not equivalent. Please refer here: GATE 2009. GATE 1994 GATE 2011 Hira Thakur answered Feb 15, 2021 • edited May 12, 2021 by Hira Thakur Hira Thakur comment Share Follow See all 0 reply Please log in or register to add a comment.