Which of the following is/are undecidable? 1. \(G\) is a CFG. Is \(L(G) =…
GATE · 2013 · CS · Computer Science & ITBARC · Computer Science · 2013
Which of the following is/are undecidable?
1. is a CFG. Is ?
2. is a CFG. Is ?
3. is a Turing machine. Is regular?
4. is a DFA and is an NFA. Is ?
- A.
3 only
- B.
3 and 4 only
- C.
1, 2 and 3 only
- D.
2 and 3 only
Attempted by 260 students.
Sign up free to check your answer
Sign up freeLoading lesson…