Which of the following problems is decidable for recursive languages L?
Pick an option to check yourself, or open the answer below.
Show answer & explanation
Correct answer: B. Is w ∈ L, where w is a string?
Explanation
A recursive language has a TM that always halts, so membership is decidable. Emptiness, universality and equality with a regular set are undecidable (Rice's theorem).
More Theory of Computation and Compilers questions
- Consider the grammar G: S → A | B, A → a | c, B → b | c, with non-terminals {S, A, B} and terminals {a, b, c}. S₁: LR(1) can parse all stri…
- The grammar S → (S) | SS | ε is not suitable for predictive parsing because the grammar is
- Two finite state machines are said to be equivalent if they :
- The finite state machine given in figure below recognizes :
- A pushdown automata behaves like a Turing machine when the number of auxiliary memory is :
- Pushdown automata can recognize language generated by_________.