1. Which of the following strings are accepted by the following Turing machine with q 5 is the final state? aab, abb, aaabb, aaab, aaaaabbb δ (q0; a) = (q1; a; R); δ (q1; a) = (q2; a; R); δ (q2; a) =...

1. Which of the following strings are accepted by the following Turing machine with q₅
is the final state?

aab, abb, aaabb, aaab, aaaaabbb

δ (q0; a) = (q1; a; R);

δ (q1; a) = (q2; a; R);

δ (q2; a) = (q3; a; R);

δ (q3; a) = (q3; a; R);

δ (q3; b) = (q4; b; R);

δ (q3; blank) = (q5; blank; L);

δ (q4; b) = (q4; b; R);

δ (q4; blank) = (q5; blank; L);

2. What language is accepted by the Turing machine in Q1?