CS381hw11 - 4. Which of the follow classes of languages are...

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

View Full Document Right Arrow Icon
CS381 Homework Assignment Number 11 due Friday, Nov. 11, 2005 Please write your name and net id on the upper right corner of each page . 1. Prove that the halting problem for Turing machine is undecidable. 2. State Rice’s theorem and write out a clear proof. 3. Construct a set that is not r.e. and whose complement is not r.e.
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: 4. Which of the follow classes of languages are closed under complement? Which are not closed under complement? Justify each answer. Finite sets, regular sets, context-free languages, recursive sets, r.e. sets...
View Full Document

This homework help was uploaded on 09/28/2007 for the course COM S 381 taught by Professor Hopcroft during the Fall '05 term at Cornell University (Engineering School).

Ask a homework question - tutors are online