hw09 - L ( G 2 ) } . Show that EQ CFG is undecidable. 3....

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

View Full Document Right Arrow Icon
CS 341: Foundations of Computer Science II Prof. Marvin Nakayama Homework 9 1. Let B be the set of all inFnite sequences over { 0 , 1 } . Show that B is uncountable, using a proof by diagonalization. 2. Recall that EQ CFG = { a G 1 ,G 2 A | G 1 and G 2 are C±Gs and L ( G 1 ) =
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: L ( G 2 ) } . Show that EQ CFG is undecidable. 3. Show that EQ CFG is co-Turing-recognizable. 4. Let S TM = { a M A | M is a TM that accepts w R whenever it accepts w } . Show that S TM is undecidable. 1...
View Full Document

This note was uploaded on 01/22/2011 for the course CIS 341 taught by Professor Nakayama during the Fall '10 term at NJIT.

Ask a homework question - tutors are online