Back to Questions

Computer Science Fundamentals Algorithms Objective

Nov 23, 2012

Which of the following statements is false?

Choose the correct answer:

A) The halting problem for Turing machines is undecidable

B) determining whether a context-free grammar is ambiguous is un-decidable

C) given two arbitrary context-free grammar, G1 and G2, it is undecidable with L(G1) = L(G2)

D) given two regular grammars G1 and G2, it is undecidable whether L(G1) = L(G2)

Detailed Explanation

No Explanation

Discussion (0)

No comments yet. Be the first to share your thoughts!

Share Your Thoughts

Feedback