1 votes 1 votes Does equivalence of CFG decidable ? That is for two CFG G1 and G2 L(G1)= L(G2)? And if it is DCFG than is it decidable. Theory of Computation decidability theory-of-computation context-free-language recursive-and-recursively-enumerable-languages + – Ayan21 asked Dec 30, 2018 Ayan21 495 views answer comment Share Follow See 1 comment See all 1 1 comment reply altamash commented Dec 30, 2018 reply Follow Share equivalence of CFG ,L(G1)= L(G2) undecidable equivalence of DCFL are decidable. 1 votes 1 votes Please log in or register to add a comment.
0 votes 0 votes if its the confirmation that you want then yeah you are right. that equivalence of CFG is not decidable, but equivalence of DCFL is decidable rballiwal answered Dec 30, 2018 rballiwal comment Share Follow See all 0 reply Please log in or register to add a comment.