1 votes 1 votes how p3 is decidable? Abhinav Gupta asked Dec 31, 2017 Abhinav Gupta 286 views answer comment Share Follow See all 3 Comments See all 3 3 Comments reply Tesla! commented Dec 31, 2017 reply Follow Share Geraud Senizergues has proved that equivalence problem of two dpda is decidiable 0 votes 0 votes hacker16 commented Dec 31, 2017 reply Follow Share P3 has to be undecidable na? 0 votes 0 votes hacker16 commented Dec 31, 2017 reply Follow Share Geraud Senizergues won the 2002 Gödel Prize "for proving that equivalence of deterministic pushdown automata is decidable". Thank you tesla! 0 votes 0 votes Please log in or register to add a comment.
