Question:medium

Consider the following statements :
A. Membership problem is decidable for regular and CFL languages.

B. Emptiness problem is undecidable for RE languages

C. Finiteness problem is decidable for regular languages

D. Equivalence problem is decidable for context-free and RE languages

Choose the correct answer from the options given below :

Show Hint

Regular languages are the most "well-behaved" as almost all their basic properties are decidable. Once you move to RE languages, Rice's Theorem makes almost everything undecidable!
Updated On: Jun 6, 2026
  • A, B, C only
  • B, C, D only
  • C, D, A only
  • A, B only
Show Solution

The Correct Option is A

Solution and Explanation

Was this answer helpful?
0


Questions Asked in CUET (PG) exam