Which of the following statements is false ?
| A. | Halting problem of Turing machines is undecidable |
| B. | Determining whether a context-free grammar is ambiguous is undecidable |
| C. | Given two arbitrary context-free grammars G1 G2 and it is undecidable whether L (G1) = L (G2). |
| D. | Given two regular grammars G1 G2 and it is undecidable whether L (G1) = L (G2) |
Answer : D Explanation : |
|
|
Option: A Explanation : Explanation will come here. Explanation will come here. Explanation will come here. Explanation will come here. Explanation will come here. |
