Scribd
Upload
6 views4 pages

Multi-Tape Turing Machines Explained

The document discusses various types of Turing machines, including multi-tape and non-deterministic Turing machines. It explains the functionality of these machines, such as reading symbols from multiple tapes and the role of control units. Additionally, it touches on linear bounded automata and context-sensitive languages.

Uploaded by

Mohammed shakeebuddin
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
6 views4 pages

Multi-Tape Turing Machines Explained

The document discusses various types of Turing machines, including multi-tape and non-deterministic Turing machines. It explains the functionality of these machines, such as reading symbols from multiple tapes and the role of control units. Additionally, it touches on linear bounded automata and context-sensitive languages.

Uploaded by

Mohammed shakeebuddin
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd

unft-5

i) Bac tfnileTm,
TutTng machnecTegoanyio

des
obe

aMuF hape Ln thrs tuinmehfnecoe


have
eoîl a si gle tape of fnttote sfze,ohfek
can be fncoeascd either left side or ight side
for
a)Multr-tapekutfng omachine
4+pel tafe2
:
pe
e
calle

Lo this TM ce have multiple tapzs cohere


contol unft takeg
bakay en reads ony one sumbol fo
ne e th e partfculak tape
) Multr header turfngmachin e: Th
-kapel les
h

In his TM thn nontXol nTl 02srst mulipe he


beaders, where it can ead eny on eas
atime. e.

Mtrdfnensiol tuting mneh fna .


|3-0

hrs rro macb rng,the fnpul t-pe fs


sesfgned coith a
dimensfonal eadimensíena
here he coatvol unt Tend s enLy ene ota
tfme

) Nen Detemfniste
o Pareaohfoptrtpvoduce
turin7machine:

one transftten then that burfng machioe is


rmowe than.

called as non -determíoístrc TM


*) Lfoear Beund Automta: atre non detesminstic

Luting machine. IL has a matkeks componets

contolunit
eonsfst of starttn symbel thal s
The fip tape censfst ot stattn

less han yrnbel te) a endfng ydeol fe reate


be
dhan symbol'Cs) and thfs Symbelsannot
eplaced coth another symbo|s .
Lce
-Aftet adfng the less than symbol the fp
healer2 p nove to the ah stde &after

ealinq the greatet thansymbol i|p header coty


ove o the leftSe.
*) HalLr
aal
bylk
flPtpe
-Acce
YAle X,x]

(0ve

- constvuet Lineat A Atomata

aalaEelcle>
Y
b,ble
,le Q Ce YV/L
(23)

,21R

*) ontet sensitiye lanagei

cohe
fs fo the
Termn ads
for m of

afe- Il)
4
cohere
Prs tevminals
B fs Ter mint
0onTermios
Halking Pxoblem;

|T.M

oesn'
-Accept not acept halts
Halts Accept
Halts Halts

You might also like