4 votes 4 votes C = { <G,x> | G is a CFG and x is substring of some y ∈ L(G) } . Then C is - a) undecidable b) Turing unrecognizable c) Recursive enumerable d) decidable Theory of Computation decidability theory-of-computation recursive-and-recursively-enumerable-languages turing-machine + – amrendra pal asked Aug 22, 2017 amrendra pal 380 views answer comment Share Follow See 1 comment See all 1 1 comment reply Shubhanshu commented Sep 19, 2017 reply Follow Share C??? 0 votes 0 votes Please log in or register to add a comment.
2 votes 2 votes Decidable because membership property for cfg is decidable Gatecoder answered Sep 26, 2017 Gatecoder comment Share Follow See all 0 reply Please log in or register to add a comment.
