1 votes 1 votes Where can we apply PCP to check, if the grammar is undecidable? Some examples of such grammars Ambiguous grammar Any other example and how they solved with PCP? Theory of Computation theory-of-computation decidability + – srestha asked Dec 6, 2018 srestha 367 views answer comment Share Follow See all 2 Comments See all 2 2 Comments reply Utkarsh Joshi commented Dec 7, 2018 reply Follow Share what do you mean by 'grammar is undecidable'? PCP can be reduced to prove undecidability ( including grammar problems) 0 votes 0 votes srestha commented Dec 7, 2018 reply Follow Share Can u give some example which can be solved in PCP? 0 votes 0 votes Please log in or register to add a comment.