UGC-NET | UGC-NET CS 2017 Nov – III | Question 22

Which of the following problems is undecidable?
(A) To determine if two finite automata are equivalent
(B) Membership problem for context free grammar
(C) Finiteness problem for finite automata
(D) Ambiguity problem for context free grammar

Answer: (D)
Explanation: Refer:Undecidability
Ambiguity problem for context free grammar is undecidable.
So, option (D) is correct.

Quiz of this Question

Article Tags :

UGC-NET

Recommended Articles

1. UGC-NET | UGC-NET CS 2017 Nov - III | Question 11

2. UGC-NET | UGC-NET CS 2017 Nov - III | Question 8

3. UGC-NET | UGC-NET CS 2017 Nov - III | Question 9

4. UGC-NET | UGC-NET CS 2017 Nov - III | Question 10

5. UGC-NET | UGC-NET CS 2017 Nov - III | Question 1

6. UGC-NET | UGC-NET CS 2017 Nov - III | Question 3

7. UGC-NET | UGC-NET CS 2017 Nov - III | Question 29

8. UGC-NET | UGC-NET CS 2017 Nov - III | Question 39

9. UGC-NET | UGC-NET CS 2017 Nov - III | Question 2

10. UGC-NET | UGC-NET CS 2017 Nov - III | Question 4

11. UGC-NET | UGC-NET CS 2017 Nov - III | Question 5

12. UGC-NET | UGC-NET CS 2017 Nov - III | Question 6

13. UGC-NET | UGC-NET CS 2017 Nov - III | Question 7

14. UGC-NET | UGC-NET CS 2017 Nov - III | Question 12

15. UGC-NET | UGC-NET CS 2017 Nov - III | Question 13

16. UGC-NET | UGC-NET CS 2017 Nov - III | Question 14

17. UGC-NET | UGC-NET CS 2017 Nov - III | Question 15

18. UGC-NET | UGC-NET CS 2017 Nov - III | Question 16

19. UGC-NET | UGC-NET CS 2017 Nov - III | Question 17

20. UGC-NET | UGC-NET CS 2017 Nov - III | Question 18

21. UGC-NET | UGC-NET CS 2017 Nov - III | Question 19

22. UGC-NET | UGC-NET CS 2017 Nov - III | Question 20

23. UGC-NET | UGC-NET CS 2017 Nov - III | Question 21

24. UGC-NET | UGC-NET CS 2017 Nov - III | Question 23

25. UGC-NET | UGC-NET CS 2017 Nov - III | Question 24