1 votes 1 votes Is equivalence problem decidable in case of-: 1) CFG's 2) DCFG's If yes, then how? Theory of Computation context-free-grammar theory-of-computation + – Aakanchha asked Jan 19, 2018 retagged Jul 8, 2019 by Cristine Aakanchha 211 views answer comment Share Follow See all 2 Comments See all 2 2 Comments reply hs_yadav commented Jan 19, 2018 reply Follow Share DCFG's 0 votes 0 votes Aakanchha commented Jan 19, 2018 reply Follow Share can you please explain how it is decidable in case of dcfg's 0 votes 0 votes Please log in or register to add a comment.