(a) L= {(G,H) | G and H are CFGs whose languages have no words in common} is co-Turing-recognizable. (b) L= {(G,x) | G is a GNFA that accepts x} is decidable.
Added by Carolina R.
Close
Step 1
Is it due to limitations, regulations, or other factors? Show more…
Show all steps
Your feedback will help us improve your experience
James Kiss and 95 other AP CS educators are ready to help you.
Ask a new question
Labs
Want to see this concept in action?
Explore this concept interactively to see how it behaves as you change inputs.
Key Concepts
Recommended Videos
Which of following statements are true? (i) Let $K, L$ be decidable languages. The concatenation of languages, $K, L$ is also decidable language. (ii) Let $L$ be Turing recognizable language. Then the complement, $L^{1}$ is also Turing recognizable language. (A) (i) and (ii) (B) Only (ii) (C) Both are false (D) Only (i)
Theory of Computation
RECURSIVELY ENUMERABLE SETS AND TURING MACHINES, DECIDABILITY
Consider language, $A=\{\angle M>: M$ is a DFA which doesn't accept any string containing odd number 1's Which of following is true about $A$ ? (A) A is Trivially decidable (B) A is undecidable (C) A is decidable (D) None of these
Krishna G.
Recommended Textbooks
Computer Science and Information Technology
Introduction to Programming Using Python
Computer Science - An Overview
Transcript
18,000,000+
Students on Numerade
Trusted by students at 8,000+ universities
Watch the video solution with this free unlock.
EMAIL
PASSWORD