self_doubt

Question

1) L(M) is recognized by a TM having even number of states.

2) L(M) is infinite.

whether this language are follow non-trivial property ?

Whether this languages are decidable  ?.

Comments

@anu sir

Second one is NOT RE  so it should be not semidecidable or undecidable??

---

abhishek we cannot prove language is infinite since we have to wait for infinite time , hence we cannot say yes .

• if for any machine we can say yes only then semidecidable.
• if can say yes or no then decidable.

Same for finite since complete of it so undecidable proved by sice tyes  =$\varnothing$  , tno = $\Sigma ^{*}$

Here tyes $\subseteq$ tno so not RE hance undecidable.

---

@Anu007    L(M) is recognized by a TM having even number of states. decidable   

You have said this , as we come to know about the states in TM through its description.

PLease guide