0 votes 0 votes Show that the two problems mentioned at the end of the preceding section, namely $\text(a)$ $L(M)$ contains any string of length five, $\text(b)$ $L(M)$ is regular, are undecidable. Theory of Computation peter-linz peter-linz-edition5 theory-of-computation decidability proof + – Rishi yadav asked Mar 16, 2019 Rishi yadav 210 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.