hw6-1 - CSE 105: Automata and Computability Theory Winter...

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

View Full Document Right Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: CSE 105: Automata and Computability Theory Winter 2011 Homework #6 Due: Tuesday, March 8th, 2011 Problem 1 Give a mapping function f showing that ETM ≤m L, where ETM is the emptyness problem for Turing machines and L is the language M, w M is a Turing machines and L(M ) = {w} . Explain why your choice of f gives a correct mapping reduction. Problem 2 Show that if L ≤m ∅ then L = ∅. (As usual, ∅ is the empty language.) Problem 3 Let L be the language G1 , G2 G1 and G2 are CFGs and L(G1 ) ≤m L(G2 ) Show that L is undecidable. Hint: You’ll want to work with ALLCFG , not EQCFG . . ...
View Full Document

This note was uploaded on 08/31/2011 for the course CSE 105 taught by Professor Paturi during the Spring '99 term at UCSD.

Ask a homework question - tutors are online