3 votes 3 votes Is equality problem for DCFL is decidable if yes then how to prove? Theory of Computation decidability theory-of-computation + – vaishali jhalani asked Dec 14, 2016 vaishali jhalani 1.0k views answer comment Share Follow See 1 comment See all 1 1 comment reply saurabh rai commented Dec 14, 2016 reply Follow Share It is a decidable problem but it is not so easy to prove http://www.lfcs.inf.ed.ac.uk/reports/99/ECS-LFCS-99-411/ECS-LFCS-99-411.pdf 1 votes 1 votes Please log in or register to add a comment.