0 votes 0 votes From http://www.cs.rice.edu/~nakhleh/COMP481/final_review_sp06_sol.pdf $L_{26}=\{<M>|$ M is a TM such that both L(M) and $\lnot L(M)$ are infinite $\}$ I was unable to get proof given in pdf above.Can anyone explain, if someone got it. Theory of Computation decidability theory-of-computation + – Ayush Upadhyaya asked Jan 13, 2019 Ayush Upadhyaya 439 views answer comment Share Follow See all 5 Comments See all 5 5 Comments reply Show 2 previous comments Shobhit Joshi commented Jan 14, 2019 reply Follow Share Works almost all the time, let's see if it works in gate ! 1 votes 1 votes Ayush Upadhyaya commented Jan 14, 2019 reply Follow Share Can I take the machine M2 to be the machine that accepts everything? 0 votes 0 votes Shobhit Joshi commented Jan 14, 2019 reply Follow Share it accepts every string of length >= 0, using only $a$ 0 votes 0 votes Please log in or register to add a comment.