aliensbrain
  • Home
  • Study
  • Quizzes
  • 🎤AI Practicefree
  • Notebooks
  • Community
  • Sign in
  • Test 1 - Theory of Computation | Computer Science(CS)
  • Which of the following problems is undecidable?
Multiple choice

Which of the following problems is undecidable?

  1. Membership problem for CFGs.

  2. Ambiguity problem for CFGs.

  3. Finiteness problem for FSAs.

  4. Equivalence problem for FSAs.

Reveal answer Fill a bubble to check yourself
B Correct answer
Explanation

Keep practicing — related questions

  • Which of the following is/are undecidable? 1. G is a CFG. Is L (G) = $\phi$? 2. G is a CFG. IS L (G) = $\su...
  • Which of the following are decidable? I. Whether the intersection of two regular languages is infinite II. ...
  • Which of the following are decidable? I. Whether the intersection of two regular languages is infinite II. ...
  • Which of the following problems are decidable? 1) Does a given program ever produce an output? 2) If L is c...
  • FSM can recognize
  • Consider the following problem x: Given a Turing machine M over the input alphabet $\sum$, any state q of M...
  • Which of the following statements is/are FALSE? (1) For every non-deterministic Turing machine, there exist...
  • Consider three decision problems P1, P2 and P3. It is known that P1 is decidable and P2 is undecidable. Whi...
Play the full quiz 🎤 Practise this topic out loud
Advertisement
© Aliensbrain | all rights reserved
  • About
  • Contact
  • Terms and Condition
  • Privacy Policy