úÎíî    Safe ’This is the machine's execution environment, consisting of the tape contents left and right of the machine's head, as well as the current state.:A machine can either accept or reject the input (for now).±The transition function maps the current state and tape contents to a triple describing the new state, the value to write to the tape, and a head movement. If the function is  = for the current state and tape contents, the machine halts.\A Turing machine has three options of moving its read head: left, right, or no move at all.ßAbstract type representing a Turing machine. It is parameterized over the alphabet and state types. A full definition contains the initial state, a list of accepting states and the transition function. Construct through  . kConstruct a Turing machine from the transition function, its initial state and a list of accepting states. dRun a machine indefinitely on the given input. If it halts, it either accepts or rejects the input. nRun a machine for the given number of steps. If this is enough for it to halt, the result is the same as for   , wrapped in ; otherwise it is  .?Run a single step in the Turing machine's execution and return   it the machine has halted.vGenerate the sequence of states that the a machine with the given initial state and transition function runs through.            turin_JnWrUnIuwdtGJHztov5wOl Data.Turing MachineResultAcceptRejectTransitionFunctionMovementMoveLeft MoveRightDontMove TuringMachinemkTuringMachinerunrunForMachineEnvironmentbaseGHC.BaseNothingJuststep stateSequenceMSTM