1 votes 1 votes Equality of languages in DCFL decidable or not??? Abhisek Tiwari 4 asked Dec 10, 2018 Abhisek Tiwari 4 2.1k views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
4 votes 4 votes $Decidable$ Gupta731 answered Dec 10, 2018 Gupta731 comment Share Follow See all 8 Comments See all 8 8 Comments reply Show 5 previous comments Gupta731 commented Dec 10, 2018 reply Follow Share Géraud Sénizergues (1997) proved that the equivalence problem for deterministic PDA (i.e. given two deterministic PDA A and B, is L(A)=L(B)?) is decidable, a proof that earned him the 2002 Gödel Prize. For nondeterministic PDA, equivalence is undecidable. 3 votes 3 votes parabol commented Dec 10, 2018 reply Follow Share Okay, Thank you. Didn't know that. 0 votes 0 votes Kanha tayal commented Sep 14, 2023 reply Follow Share Can you tell me the resource from where you have read. 0 votes 0 votes Please log in or register to add a comment.