Question: Question: a) Prove that the language L is decidable where L = {G|G is a CFG which generates a string with length greater than 5}.
Question: a) Prove that the language L is decidable where L = {G|G is a CFG which generates a string with length greater than 5}.
b) What is wrong with the following proof? Why?
T=On input string G: 1. Check whether G represents a valid CFG. 2. Generate all strings of length greater than 5 in lexicographic order. If a string of length greater than 5 is generated, accept. Reject otherwise.
T is a decider, therefore, L is decidable.

3. (20 points) a) Prove that the language L is decidable where L = {(G)\G is a CFG which generates a string with length greater than 5}. b) What is wrong with the following proof? Why? T="On input string (G): 1. Check whether G represents a valid CFG. 2. Generate all strings of length greater than 5 in lexicographic order. If a string of length greater than 5 is generated, accept. Reject otherwise. T is a decider, therefore, L is decidable
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
