1. Consider machine M-(Q, Σ. Γ. δ.ql, qaccept, qreject), where Q-{qi, q2, q3, qaccept, qreject}, -{0.1), Г-{0.1 Ủ}, and the transition function as follows is δ (qi, U)-Greject, U, R) Prove that M is...
Consider machine M (Q. Σ , Γ, δ, q1, qaccept, qreject), where Q ,{qi, q2, gs, qaccept, qreject}, Σ as follows: { 0.1 } , Γ { 0.1 U } , and the transition function δ is δ (qi. Ú)-(qreject, U, R) δ (qi, 0)-(P-0, R) -(Gaccept, Prove that M is NOT a decider Describe in mathematical terms the language A that M recognises, and verify 1. your answer, ie prove that A- L(M) Consider machine M (Q. Σ ,...