Consider the following properties of recursively enumerable sets:
(A) Finiteness
(B) Context-freedom
(C) Emptiness
Which of the following is true?
Pick an option to check yourself, or open the answer below.
Show answer & explanation
Correct answer: D. All of (A), (B) and (C) are not decidable
Explanation
All three are non-trivial properties of RE languages, so each is undecidable by Rice's theorem.More Theory of Computation and Compilers questions
- Consider the grammar S → SbS | a and the string abababa. Consider the statements: the string has (A) two parse trees (B) two leftmost deriv…
- Match List I with List II. Choose the correct answer from the options given below:List I List II A. Type 0 I. Finite automata B. Type 1 II.…
- Consider the following statements: Statement I: An LALR parser is more powerful than a canonical LR parser. Statement II: An SLR parser is…
- Consider the following statements about context-free languages (CFL): Statement I: CFLs are closed under homomorphism. Statement II: CFLs a…
- Match List – I with List – II. List – I (Propositions) (A) P ∧ (P → Q) (B) ¬(P ∨ Q) → (P ∧ Q) (C) P → Q (D) P ∨ (Q ∧ R) List – II (Disjunct…
- Overfitting is expected when we observe that?