Build a Turing machine that applies to all words in the alphabet {a, b} and translates them into the word a.

1 1/5

step-by-step explanation:

answer 1 : option "c"

answer 2 : option "d"

answer 3 : option "b"

answer 4 : option "d"

answer 5 : option "b"

answer 6 : option "a"

answer 7 : option "c"

answer 8 : option "d"

answer 9 : option "c"

answer 10 : option "d"

answer 11 : option "c"

answer 12 option "b"

answer 13 option "c"

answer 14 option "c"

answer 15 option "d"

answer 16 option "a"

answer 17 option "b"

answer 18 option "c"

answer 19 option "a"

answer 20 option "a"

answer 21 option "c"

d

-8/2y-8=5/y+4-7y+8/y^2-16

we move all terms to the left:

-8/2y-8-(5/y+4-7y+8/y^2-16)=0

we can not solve this equation