{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}

52 Slides--Decidability, Reductions

# 52 Slides--Decidability, Reductions - CS103 HO#52...

This preview shows pages 1–2. Sign up to view the full content.

CS103 HO#52 Slides--Decidability, Reductions May 19, 2010 1 Theorem: 4.5 – Equivalence Testing Language: EQ DFA = { A, B | A and B are DFAs and L(A) = L(B) } Result: DECIDABLE Proof idea: Construct a DFA for (L(A) L(B)) (L(A) L(B)). Accept if T accepts; otherwise reject. Note that regular languages are closed under union, intersection, and complementation. Machine name: F (L(A) L(B)) (L(A) L(B)) = Ø (L(A) L(B)) = Ø and (L(A) L(B)) = Ø x ((x L(A) x L(B)) and (x L(B) x L(A))) L(A) = L(B) Other Problems for Regular Languages A B A B B A L(A) L(B) (L(A) L(B) Theorem: 4.7 – Does a CFG generate a string? Language: A CFG = { G, w | G is a CFG that generates w } Result: DECIDABLE Proof idea: Convert to Chomsky Normal Form. Where n = |w|, try all derivations up to 2n – 1 steps, or if n = 0, 1 step. Machine name: S Theorem: 4.8 – Emptiness Testing for L(CFG) Language: E CFG = { G | G is a CFG and L(G) = Ø } Result: DECIDABLE Proof idea: Mark terminals. Mark A if A generates a sequence of marked symbols. If the start variable is not marked, accept; else reject. Machine name: R Theorem: 4.9 –CFLs are decidable Language: A CFL = { A, w | A is a CFL and w A } Result: DECIDABLE Proof idea: Let G be a CFG for A. Run S on G, w . Machine name: M G Decidability Problems for Context-Free Languages Decidability Problems for Context-Free Languages Note that EQ CFG = { G, H | G and H are CFGs and L(G) = L(H) } is not decidable. CFGs are not closed under complementation or intersection. Regular Context-Free Decidable Turing-recognizable A DFA A NFA A REX E DFA EQ DFA A CFG A CFL E CFG Anything out here? Theorem 4.17: R is not countable. Corollary 4.18: Some languages are not Turing-recognizable For any alphabet , the set of strings * is countable, since there are a finite number of strings of any length. The set of Turing machines is countable since each TM has an encoding as a string.

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

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

{[ snackBarMessage ]}

### What students are saying

• As a current student on this bumpy collegiate pathway, I stumbled upon Course Hero, where I can find study resources for nearly all my courses, get online help from tutors 24/7, and even share my old projects, papers, and lecture notes with other students.

Kiran Temple University Fox School of Business ‘17, Course Hero Intern

• I cannot even describe how much Course Hero helped me this summer. It’s truly become something I can always rely on and help me. In the end, I was not only able to survive summer classes, but I was able to thrive thanks to Course Hero.

Dana University of Pennsylvania ‘17, Course Hero Intern

• The ability to access any university’s resources through Course Hero proved invaluable in my case. I was behind on Tulane coursework and actually used UCLA’s materials to help me move forward and get everything together on time.

Jill Tulane University ‘16, Course Hero Intern