27.0k views
5 votes
Say that a variable A in CFG G is necessary if it appears in every derivation of some string w ∈ G. Let NECESSARY CFG = A is a necessary variable in G.

a. Show that NECESSARY CFG is Turing-recognizable.
b. Show that NECESSARY CFG is undecidable.

User Shajji
by
5.1k points

2 Answers

4 votes

Answer:

NECESSARY CFG is Turing-recognizable and undecidable already shown bellow

Step-by-step explanation:

Say that a variable A in CFG G is necessary if it appears in every derivation of some-example-1
Say that a variable A in CFG G is necessary if it appears in every derivation of some-example-2
User James Tanner
by
5.4k points
3 votes

Answer:

Step-by-step explanation:

solution

User Pedorro
by
5.9k points