hw3 - R w whenever it accepts w}, where R w is the string...

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

View Full Document Right Arrow Icon
Homework 3-----CSCI6339 Fall 2009 Due on November 18, 2008 (Wednesday) Type your solution with Microsoft word. 1. Show that T={(i,j,k)| i, j, k are all integers} is countable. 2. Show that there is a correspondence between the two intervals (0,1) and [0,1]. 3. Let A={<R,S> | R and S are regular expression and L(R ) = L( S)}. Show that A is decidable. 4. Let T= {<M> | M is a TM that accepts
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: R w whenever it accepts w}, where R w is the string by writing w in the reverse order (e.g., R w =dfge if w=egfd) . Show that T is undecidable. 5. Let S={<M> | M is a TM and L(M) = {<M>}}. Show that neither S nor its complement S is Turing-recognizable. 6. Show that if A is Turing recognizable if and only if TM m A A ≤ ....
View Full Document

This note was uploaded on 02/22/2010 for the course CS 881 taught by Professor H.f. during the Spring '10 term at Shahid Beheshti University.

Ask a homework question - tutors are online