1,737 views
4 votes
4 votes
L1= {⟨M⟩| M is a TM and |L(M)| = 5 }.

we know about at least and at most case, but someone explain equal to case.

Furthermore, I'll complie more questions in same thread only.

L2= {⟨M⟩| M is a TM and M does not accept all even numbers}.

L3 = {⟨M⟩| M is a TM and M reject all even numbers}.

1 Answer

Related questions

2 votes
2 votes
2 answers
2
rahul sharma 5 asked Aug 7, 2017
650 views
Check whether the language below is recursive, recursively enumerable but not recursive, or not recursively enumerable?{⟨M1,M2⟩∣ M1 and M2 are two TMs, and ϵ∈L(M...
0 votes
0 votes
0 answers
4