0 votes 0 votes CFG G=(N,Σ,P,S) and a string x∈Σ∗, does x∈L(G)} ? Is it Decidable? Theory of Computation theory-of-computation decidability + – Shamim Ahmed asked Jan 2, 2019 Shamim Ahmed 458 views answer comment Share Follow See all 7 Comments See all 7 7 Comments reply Show 4 previous comments Gupta731 commented Jan 2, 2019 reply Follow Share For CFG, L(G)= Σ* is undecidable and x∈L(G) is decidable. 0 votes 0 votes Naveen Kumar 3 commented Jan 2, 2019 reply Follow Share @Gupta731 thanx I missed it. 0 votes 0 votes Shamim Ahmed commented Jan 2, 2019 reply Follow Share right! 0 votes 0 votes Please log in or register to add a comment.
