Problem 1 Design a Turing Machine recognizing each of the following languages and draw its state diagram (note that the transition functions of the Turing Machine must be in the format of “a → b,L/R",...

Source:
https://www.mog.dog/files/SP2019/Sipser_Introduction.to.the.Theory.of.Computation.3E.pdf

Extracted text: Problem 1 Design a Turing Machine recognizing each of the following languages and draw its state diagram (note that the transition functions of the Turing Machine must be in the format of “a → b,L/R", namely the machine reads single symbol a from the tape, writes single symbol b to the cell to replace a, and then goes to either left L or right R): (3) {w |w= a'b'A, i<>