0 votes 0 votes L= {<G> | G is CFG and G is NOT ambiguous} . L is TM recognizable or not even TM recognizable? Theory of Computation decidability theory-of-computation + – Soumya29 asked Dec 16, 2017 Soumya29 1.1k views answer comment Share Follow See all 12 Comments See all 12 12 Comments reply Show 9 previous comments srestha commented Jun 1, 2018 reply Follow Share but 1) wheather L(G) is CFL? is decidable So, why not we make a TM which accepts all unambiguous grammar? 0 votes 0 votes Arjun commented Jun 1, 2018 reply Follow Share @srestha Who told that is decidable? 0 votes 0 votes srestha commented Jun 1, 2018 reply Follow Share when G is DCFG here we find ,"if L(G) is CFL" is decidable right? -------------------------------------------------------------------------- My question was G is CFG here when we find ,"if L(G) is CFL" is decidable or not? ----------------------------------------------------------------------------- Moreover , an ambiguous grammar is undecidable. Does it mean, an unambiguous grammar also need to be undecidable? 0 votes 0 votes Please log in or register to add a comment.
0 votes 0 votes as L is CFG it is subset of UG that is TM recoznigable suryaprakash answered Jun 1, 2018 suryaprakash comment Share Follow See 1 comment See all 1 1 comment reply Arjun commented Jun 1, 2018 reply Follow Share who told $L$ is CFL? 1 votes 1 votes Please log in or register to add a comment.