The GATE Grind

GATE 2007 CS – Question 6

Theory of Computation · Turing Machines and Undecidability · 1 mark · Multiple choice

Which problem is undecidable?

  1. Membership for CFGs
  2. Ambiguity for CFGs
  3. Finiteness for FSAs
  4. Equivalence for FSAs

Practise this question in The GATE Grind →

Show answer and explanation

Correct answer: (B) Ambiguity for CFGs

Explanation

We are sorry we couldn't write detailed soluition for this, we are working on it!, please consider asking your own AI, its just 2-3 clicks with very minimum effort

More Turing Machines and Undecidability questions

All Turing Machines and Undecidability questions →