Which of the following problems is undecidable ?
PYQ UGC NET 2017
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
Attempted by 204 students.
Sign up free to check your answer
Sign up freeLoading lesson…

