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 Turingrecognizable. 6. Show that if A is Turing recognizable if and only if TM m A A ≤ ....
View
Full Document
 Spring '10
 H.F.
 Formal language

Click to edit the document details