Topic: Discrete Mathematics and its Applications" Chapter 13 Modeling Computation:Turing Machines

6. Construct a Turing machine that emulates the following deterministic finite- state automaton (that is, you put the input string on the tape, position the head at the beginning of the string, and the Turing machine goes through each state that the automaton would go through with that input string. The machine halts after reading the last symbol. The string is accepted in the language if the Turing machine halts in states so, 83, or s4): 0 0 0 Start 0,1 0,1 6. Construct a Turing machine that emulates the following deterministic finite- state automaton (that is, you put the input string on the tape, position the head at the beginning of the string, and the Turing machine goes through each state that the automaton would go through with that input string. The machine halts after reading the last symbol. The string is accepted in the language if the Turing machine halts in states so, 83, or s4): 0 0 0 Start 0,1 0,1