0 votes 0 votes Equivalence of 2 CFL's is decidable or not? Equivalence of 2 Regular languages is decidable or not? Equivalence of 2 CSL is decidable or not? Equivalence of 2 Recursive languages is decidable or not? Equivalence of 2 DPDA's is decidable or not? Equivalence of 2 PDA's is decidable or not? Theory of Computation theory-of-computation + – Mk Utkarsh asked Nov 20, 2018 Mk Utkarsh 606 views answer comment Share Follow See all 4 Comments See all 4 4 Comments reply goxul commented Nov 20, 2018 reply Follow Share 1 is undecidable, as a consequence of which, 6 is also undecidable. 2 is decidable. I'm not sure about 5, but I think it should also be undecidable as we can create a CFG for every DPDA. 0 votes 0 votes kumar.dilip commented Nov 20, 2018 reply Follow Share Only 2 is decidable and Rest is Undecidable. 0 votes 0 votes Mk Utkarsh commented Nov 20, 2018 reply Follow Share 5 is decidable 0 votes 0 votes goxul commented Nov 20, 2018 reply Follow Share Oh right, I forgot the whole Godel prize story behind 5. 0 votes 0 votes Please log in or register to add a comment.
2 votes 2 votes Equivalence of regular and dcfls are decidable and for the rest of the languages it is undecidable. Ashish Mishra 9 answered Nov 20, 2018 Ashish Mishra 9 comment Share Follow See all 0 reply Please log in or register to add a comment.