PROGRAMMING TECHNIQUES TO TURING MACHINE

  PROGRAMMING TECHNIQUES TO TURING MACHINE INTRODUCTION: Turing Machine was invented by Alan Turing in 1936 and it is used to accept Recursive Enumerable Languages (generated by Type-0 Grammar).  A Turing machine consists of a tape of infinite length on which a read and write operation can be performed. The tape consists of infinite cells on which each cell either contains an input symbol or a special symbol called blank. It also consists of a head pointer which points to the cell currently being read and it can move in both directions. A Turing Machine is expressed as a 7-tuple (Q, T, B, ∑, δ, q0, F) where:    Q is a finite set of states T is the tape alphabet (symbols which can be written on Tape) B is blank symbol (every cell is filled with B except input alphabet initially) ∑ is the input alphabet (symbols which are part of input alphabet) δ is a transition function which maps Q × T → Q × T × {L,R}. Depending on its present state and present tape alphabet (pointe...