Lecture11 - 15-453 FORMAL LANGUAGES, AUTOMATA AND...

Info iconThis preview shows pages 1–10. Sign up to view the full content.

View Full Document Right Arrow Icon
FORMAL LANGUAGES, AUTOMATA AND COMPUTABILITY 15-453
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
ATM = { (M,w) | M is a TM that accepts string w } HALTTM = { (M,w) | M is a TM that halts on string w } ETM = { M | M is a TM and L(M) =  } REGTM = { M | M is a TM and L(M) is regular} ALLPDA = { P | P is a PDA and L(P) = Σ* } EQTM = {( M, N) | M, N are TMs and L(M) =L(N)} ALL UNDECIDABLE Use Reductions to Prove Which are SEMI-DECIDABLE?
Background image of page 2
A B f f Let f : Σ*  Σ* be a computable function such that w  A  f(w)  B Say: A is mapping reducible to B; Write: A m B Σ* Σ* Also, A m B , why?
Background image of page 3

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Theorem: If A m B and B is ( semi ) decidable, then A is ( semi ) decidable Proof: Let M decide B and let f be a reduction from A to B We build a machine N that decides A as follows: On input w: 1. Compute f (w) 2. Run M on f (w)
Background image of page 4
CLAIM: ATM m HALTTM f: (M,w)  (M’, w) where M’( w) = M(w) if M(w) accepts Loops otherwise So, (M, w ) ATM  (M’, w)  HALTTM ATM = { (M,w) | M is a TM that accepts string w } HALTTM = { (M,w) | M is a TM that halts on string w } CONSTRUCT f : Σ*  Σ* So HALTTM is NOT DECIDABLE, but it is SEMI-DECIDABLE (Why?)
Background image of page 5

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
CLAIM: ATM m  ETM f: (M,w)  Mw where Mw (s) = M(w) if s = w Loops otherwise So, (M, w ) ATM  Mw  ETM ATM = { (M,w) | M is a TM that accepts string w } ETM = { M | M is a TM and L(M) =  } CONSTRUCT f : Σ*  Σ* So, M(w) accepts  L (Mw)   ATM m ETM So  ETM is NOT DECIDABLE, but it is SEMI-DECIDABLE ( why?) Is ETM SEMI-DECIDABLE?
Background image of page 6
CLAIM: ATM m REGTM f: (M,w)  M’w where M’w (s) = accept if s = 0n1n M(w) otherwise So, (M, w ) ATM  M’w  REGTM ATM = { (M,w) | M is a TM that accepts string w } REGTM = { M | M is a TM and L(M) is regular} CONSTRUCT f : Σ*  Σ* So, L (M’w) = Σ* if M(w) accepts { 0n1n } if not So REGTM is UNDECIDABLE Is REG SEMI-DECIDABLE?
Background image of page 7

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
CLAIM:  ATM m REGTM f: (M,w)  M”w where M”w (s) = accept if s = 0n1n and M(w) accepts Loop otherwise So, (M, w )  ATM  M”w  REGTM ATM = { (M,w) | M is a TM that accepts string w } REGTM = { M | M is a TM and L(M) is regular} CONSTRUCT f : Σ*  Σ* So, L (M’w) = { 0n1n } if M(w) accepts if not So, REG NOT SEMI-DECIDABLE So, REG NOT SEMI-DECIDABLE
Background image of page 8
CLAIM: ETM m
Background image of page 9

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Image of page 10
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 02/29/2012 for the course CS 15-453 taught by Professor Edmundm.clarke during the Spring '09 term at Carnegie Mellon.

Page1 / 52

Lecture11 - 15-453 FORMAL LANGUAGES, AUTOMATA AND...

This preview shows document pages 1 - 10. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online