1 votes 1 votes Given the following statements: The power of deterministic finite state machine and non- deterministic finite state machine are same. The power of deterministic pushdown automaton and non- deterministic pushdown automaton are same. Which of the above is the correct statement(s)? Both I and II Only I Only II Neither I nor II Theory of Computation ugcnetcse-june2012-paper3 theory-of-computation finite-automata + – go_editor asked Jul 6, 2016 • recategorized Oct 23, 2018 by Pooja Khatri go_editor 3.2k views answer comment Share Follow See 1 comment See all 1 1 comment reply vijaycs commented Jul 6, 2016 reply Follow Share Ans- B 1 votes 1 votes Please log in or register to add a comment.
1 votes 1 votes ALL Finite Automata have same expressive power Determistic CFL(DCFL) is a proper subset of CFL so DPDA < NPDA So, B is Correct gshivam63 answered Jul 6, 2016 gshivam63 comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes option B is correct rameshbabu answered Jul 6, 2016 rameshbabu comment Share Follow See all 0 reply Please log in or register to add a comment.