367 views
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?

Please log in or register to answer this question.

Related questions

0 votes
0 votes
0 answers
1
Sparsh-NJ asked Aug 6, 2023
219 views
If G is a CFG then L(G) = (Sigma)* is Decidable or Undecidable?The reference where I solved this question says this is an Undecidable problem! But I think it's Decidable ...
0 votes
0 votes
0 answers
2
jatin khachane 1 asked Jan 8, 2019
697 views
L1 = { <M | M halts on $\epsilon$ }L2 = { <M | $\epsilon$ $\in$ L(M) }Which one is RE or not RE