This preview shows page 1. Sign up to view the full content.
Unformatted text preview: L ( G 2 ) } . Show that EQ CFG is undecidable. 3. Show that EQ CFG is coTuringrecognizable. 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.
 Fall '10
 Nakayama
 Computer Science

Click to edit the document details