Define deterministic Turing machine (DTM):

• a quintuple (Q, Σ, Γ, δ, s), where

-   the set of states Q is finite, not having halt state h,

-   the input alphabet Σ is a finite set of symbols not having the blank symbol Δ,

-   the tape alphabet G is a finite set of symbols having Σ, but not including the blank symbol Δ,

-   the initial state s is in Q, and

-   the transition function d is the partial function from Q * (∪Γ{Δ}) → Q∪{h} * (∪Γ{Δ}) * {L, R, S}.

Example of a DTM Definition

Definition

Definition

Yield in zero step or more: Example

s,Δ001000)

(p1,@0001000)

(p2,@Δ001000)

(p2,@Δ001000Δ)

(p3,@Δ001000)

(p4,@Δ00100Δ)

(p4,@ Δ00100Δ)

(p1,@Δ00100Δ)

(p2,@ΔΔ0100Δ)

(p4,@ΔΔ010)

(p4,@ΔΔ010)

(p1,@ΔΔ010)

(p2,@ΔΔΔ10)

(p2,@ΔΔΔ10)

(p2,@ΔΔΔΔ10Δ) 

(p3,@ΔΔΔ10)

(p4,@ΔΔΔ1)

(p4,@ΔΔΔ1)

(p1,@ΔΔΔ1)

(q1,@ΔΔΔ Δ)

(q1,@)

(q2,ΔΔ)

(h ,Δ1)

(p2,@ΔΔ0100 Δ)

(p3,@ΔΔ0100)

Email based Automata assignment help - homework help

The study of automata is an important area of theory of computation. Students feel trouble in solving automata questions. We at www.expertsmind.com offers Automata assignment help - Automata homework help and online tutoring with best qualified and experienced computer science tutor's help. We cover all topics including Define Deterministic Turing Machines in assignment help - homework help service. Get solved problems in automata theory with step by step answers anytime from expert tutors at expertsmind.