Consider the following language definition:
L={⟨M⟩ ∣ M is a DFA and M accepts some string of the form ww^R for some w∈Σ∗}
L is
- Regular
- Context-free but not regular
- Recursive but not context-free
- Recursively enumerable but not recursive
Answer is option 3. Can someone please explain how L is recursive?
L2 ={⟨M⟩ ∣ M is a TM and M accepts some string of the form ww^R for some w∈Σ∗}
But L2 is not recursive.
Please explain the conclusions of L and L2.
For L2 through rice theorem, do we say it's not trivial and hence undecidable and not recursive?
