hw6 - C is Turing-recognizable i there is a decidable...

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
CS 181 — Winter 2006 Problem Set #6 Formal Languages Due February 27, 2008 Problem 6.1. (10 points) Show that a language for which there exists an enumerator that enumer- ates the language in increasing lexicographical order is a decidable language. [For this, give a high level description of a Turing machine that halts on all inputs and accepts exactly the language.] Problem 6.2. (10 points) Show that a language
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: C is Turing-recognizable 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.

Ask a homework question - tutors are online