Consider Language C G Cfg X Substring Y L G Show C Decidable Note One Way Solve Involves D Q37215999

Consider the language:

C= {<G, X> | G is a CFG, and x is a substringof some y ∈L(G)}

Show that C is decidable (note: one way to solve this involvesthe decider for ECFG).

Answer

Hope it will helps you.Please give Thumbs Up!! Thank you for posting the question, All thebest.

psom ie gven sning modineCr) an e tove utax eject else, accept H. it halts. And also l) C7 genes

OR

 

OR