Question: (30 points) Say that a variable A in CFG G is necessary if it appears in every derivation of some string wL(G). Let NECESSARY

(30 points) Say that a variable A in CFG G is necessary

 

(30 points) Say that a variable A in CFG G is necessary if it appears in every derivation of some string wL(G). Let NECESSARY CFG = {(G, A) | A is a necessary variable in G}. (a) Show that NECESSARY CFG is Turing-recognizable. (b) Show that NECESSARY CFG is undecidable.

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Programming Questions!