Let AMBIG CFG = {G| G is an ambiguous CFG}. Show that AMBIGCFG is undecidable. Use a

Question:

Let AMBIGCFG = {〈G〉| G is an ambiguous CFG}. Show that AMBIGCFG is undecidable. Use a reduction from PCP. Given an instance

 


of the Post Correspondence Problem, construct a CFG G with the rules

S - T|B T + tịTa1|| B - bị Bai | | tkTak | tia1 | | br Bak | biai | .. | tkak | bkak ,


where a1, . . . , ak are new terminal symbols. Prove that this reduction works.

Fantastic news! We've Found the answer you've been seeking!

Step by Step Answer:

Related Book For  book-img-for-question
Question Posted: