0 votes 0 votes 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 ?. Theory of Computation turing-machine theory-of-computation + – Nils asked Dec 14, 2017 • edited Dec 15, 2017 by Nils Nils 580 views answer comment Share Follow See all 6 Comments See all 6 6 Comments reply Show 3 previous comments abhishek tiwary commented Dec 15, 2017 reply Follow Share @anu sir Second one is NOT RE so it should be not semidecidable or undecidable?? 0 votes 0 votes Anu007 commented Dec 15, 2017 reply Follow Share 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. 2 votes 2 votes Learner_jai commented Dec 17, 2018 reply Follow Share @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 0 votes 0 votes Please log in or register to add a comment.