Give Formal Definition Line Turing Machine Q37135969

December 7, 2021 by Administrator

Give a formal definition of an off-line Turingmachine

Solution

Turing Machine:

Turing machine is a finite state machine with the one tape headand infinite tapes that can read one tape cell and move left andright.

Tape is used for input and store the worked output.
It normally accepts the string or completes computation byentering the finite state aka final state or accepting state.

M = ( $Q,sum ,Gamma ,delta ,q0,B,F$ )

Q is finite state

$sum$ is a set of inputsymbols

$Gamma$ is a finitestate

$delta$ is next movefunction

q0 start state

B symbol of $Gamma$ is