Consider the languageA?CFG=hGi:Gis a CFG that generates?. Atrivialway to show thatA?CFGis decidable is to run the TM forACFGtosee whetherhG, ?i ?ACFG.Instead, show thatA?CFGis decidable byexhibiting a direct algorithm for it (that doesn’tinvolveconvertingGto Chomsky normal form). You should find someinspiration forthis byreviewing the algorithm forECFG.

2.
PayPal Gateway not configured
PayPal Gateway not configured