This preview shows page 1. Sign up to view the full content.
Unformatted text preview: C is Turingrecognizable i there is a decidable language D such that C = { x  y. ( h x,y i D ) } . Problem 6.3. (10 points) Show that {h G i  G is a CFG that generates innitely many strings } is decidable. Let C CFG = {h G,k i  L ( G ) contains exactly k strings where k 0 or k = } . Show that C CFG is decidable. [Hint: Use the pumping length of G .]...
View
Full
Document
This note was uploaded on 06/03/2008 for the course CS 181 taught by Professor Rupak during the Winter '08 term at UCLA.
 Winter '08
 Rupak

Click to edit the document details