Question 9.32 on theory of computation undecidability problems

t Reader File Edit View Window Help Home Tools 10.1.1.465.3774.pdfx Sign In ) () 330 (343 of 449) 15096 Share Bookmarks a. Describe a way to enumerate explicitly the set of context-sensitive Export PDF grammars generating languages over [a, b). You may make the assumption that for some set A A1, A2, |, every such grammar has start symbol A1 and only variables that are elements of A Create PDF WCHAPTER 8 Recursively Enumerable Languages b. If G, G2. is the enumeration in part (a), and xi, x2, OE Edit PDF are the CHAPTER 9 nonnull elements of {a, b)" listed in canonical order. Iet L-(xi | xi L(Gi)]. Show that L is recursive and not context-sensitive Undecidable Problems Comment 9.1 A Language That Can't Be Accepted, and a Problem That Can't Be Decided Combine Files 9.32. Show that each of the following decision problems for CFGs is undecidable a. Given two CFGs G1 and G2. s L(G) = L(G2)? b. Given two CFGs G, and G2. sL(G) L(G2)? C. Given a CFG G and a regular language R. is L(G) = R? anize P 9.2 Reductions and the Halting Problem 9.3 More Decision Problems Involving Turing Machines 9.4 Post's Correspondence Problem Protect 9.33. Is the decision problem. "Given a CFG G, and a string x, is 9.34. Is the decision problem. "Given a CFG G and a regular language R, is 9.35. Show that the problem. "Given a CFG G with terminal alphabet 2, is Optimize PDF Fill &Sign Adobe Sign Share L (G)-{x}?" decidable or undecidable? Give reasons for your answer 9.5 Undecidable L(G) C R?" decidable or undecidable? Give reasons for your answer Problems Involving Context-Free Languages L(G) 2" is undecidable by directly reducing PCP to it. Suggestion: ifG and G are the CFGs constructed from an instance of PCP as in Section 9 5 show that there e an aloor.thm toconstrileta CFG oeneratin Convert and edit PDFs with Acrobat Pro DC ises CHAPTER 10 Comnutable Functions Start Free Trial 7.35 x9.07 in