TITLE: TURING MACHINES

SUB JECT: - FI N I T E AU T OMA TA A N D

F OR MAL LA N GU AGE( F L A T)
UNDER THE D I R ECT I O N O F : SUDHI R MEES AL A
CI A: 4
NAME:- Vaibhav Patil NAME:- Thesna

BRANCH:- CSE AIML BRANCH:- CSE Aiml

PRN:-210105231001 PRN:-

DIVISION:- A DIVISION:- A

NAME:- Ashish patil

BRANCH:- CSE Aiml

PRN:- 210105231023

DIVISION:- A
 INTRODUCTION

A TURING MACHINE IS A MATHEMATICAL MODEL OF

COMPUTATION THAT DEFINES AN ABSTRACT
MACHINE THAT MANIPULATES SYMBOLS ON A STRIP
OF TAPE ACCORDING TO A SET OF RULES. TURING
MACHINES ARE OFTEN USED TO STUDY THE LIMITS
OF COMPUTATION AND TO PROVE THAT CERTAIN
PROBLEMS ARE UNSOLVABLE.
 A T URI NG M AC HI NE C O N S I S T S O F T H E F O L L O W I N G
C OMPONENTS :
A T APE: THE TAP E I S AN I N F I N I T E S T R I P O F CE L LS,
EAC H OF WHI C H C AN C ON T AI N O N E S Y M B O L . T HE
T AP E I S I NI TI AL L Y BL ANK E XCE PT F O R T H E I N PU T
ST R I N G, WH I C H I S WRI TTE N O N T H E L E F T MO S T
C EL L S OF TH E TAP E.
A H EAD: THE HEAD I S A PO I N T E R T H AT CAN R E AD
COMPONENTS OF A AND WRI TE S YM BO L S O N T H E T APE . T H E H E AD CAN
AL S O MOVE L EF T O R RI GH T O N T H E T APE .
TURING MACHINE A S TATE REG I S TER: THE S T AT E R E GI S T E R S T O R E S TH E
C UR RENT STATE O F THE M ACH I N E .
A T RANSI TI ON TABL E: THE T R AN S I T I O N T AB L E
SP ECI F I ES HO W THE M ACH I N E S H O U L D MO VE F R OM
ONE S TATE TO ANO THER W H E N I T R E ADS A S Y MBOL
ON THE TAP E.
 T HE T URI NG MAC HI NE WO R KS B Y R E ADI N G T H E
SY MBOL ON THE TAP E U N DE R T H E H E AD AN D
T HEN PERFO RMI NG THE ACT I O N S PE CI F I E D B Y
T HE T RANSI TI O N TABL E. T H E ACT I O N CAN B E T O
HOW A TURING WRI TE A NEW S YM BO L O N T H E T APE , M O VE T H E
MACHINE WORKS HEAD L EFT OR RI G HT, O R CH AN GE T H E S T AT E O F
T HE MACHI N E. THE MAC H I N E R E PE AT S T H I S
P RO CESS UN TI L I T REAC H E S A F I N AL S T AT E .
 TASK :
OUR T ASK I S TO DES I G N A T U R I N G MACH I N E F O R
AN EQUAL N UM BER O F A ’S AN D B ’S .

ANAL YSI S :
HER E T HE M AI N THI NG T O AN AL Y Z E T H AT S T R I NG
C ON SI ST OF EQ UAL NUMB E R S O F A’S AN D B ’S
CAN BE OF 4 TYP ES –
EXAMPLE OF A TURING HER E ‘ N’ I S T HE C O UNT OF A’S O R B ’S .

MACHINE A) A^N B^N L I K E AABB

B) B^N A^N L I K E BBAA

C ) ( AB) ^N L I KE ABAB

D) ( BA) ^N L I K E BABA
 EXAMPL E :
I NP UT- 1 : AABB
OUT PUT : YE S

I NP UT- 2 : BA BABA
OUT PUT : YE S

EXAMPLE OF A TURING I NP UT- 3 : AA BBBB

OUT PUT : NO
MACHINE
I NP UT- 4 : AA ABBAA
OUT PUT : NO
 4]NOW WE SEE THAT WE GET OUR FIRST ‘A’ AT THE FIRST
1]SCAN THE INPUT FROM THE LEFT. POSITION AND FIRST B IN THE THIRD POSITION. WE
2]OUR STRING LOOKS LIKE THIS CONVERT THESE ‘A’ AND ‘B’ TO ‘X’.
NOW THE CHARACTER ‘A’ WE GET IN BETWEEN ‘A’ AND ‘B’.
SO IT WILL REMAIN THE SAME. WHEN WE READ OUR FIRST B
WE MOVE OUR POINTER TO LEFT. THE POINTER WILL MOVE
TO THE LEFT UNTIL IT GETS A BLANK(B). NOW OUR STRING
LOOKS LIKE THIS –

3]NOW WE SEE THAT WE GET OUR FIRST ‘A’ AT THE

FIRST POSITION AND FIRST B IN THE THIRD POSITION.
WE CONVERT THESE ‘A’ AND ‘B’ TO ‘X’.
NOW THE CHARACTER ‘A’ WE GET IN BETWEEN ‘A’ AND
‘B’. SO IT WILL REMAIN THE SAME. WHEN WE READ OUR
FIRST B WE MOVE OUR POINTER TO LEFT. THE POINTER
WILL MOVE TO THE LEFT UNTIL IT GETS A BLANK(B).
NOW OUR STRING LOOKS LIKE THIS –
WE REPEAT THIS PROCESS UNTIL ALL
A’S AND B’S CONVERTED TO X.
AS WE SEE THAT WE CONVERT ALL
A’S AND B’S TO ‘X’. HENCE OUR
MACHINE WILL HALT.
WHEN WE ANALYZE THIS PROCESS
WE SEE THAT WE CONVERT A’S AND
B’S TO X IN PAIR I.E. IN POINT 3 WE
CONVERT THE FIRST OCCURRENCE OF
A AND B TO X AND THEN IN POINT 4
WE CONVERT THE SECOND
OCCURRENCE OF A AND B TO X. IF
THERE ARE AN UNEQUAL NUMBER OF
AND B THEN, IN THIS CASE, SOME A
OR B WILL BE LEFT IN OU STRING,
OTHERWISE ALL THE CHARACTER
WILL BE CONVERTED TO X. HENCE IT
WILL GIVE US A POINT TO PROOF OUR
CONDITION THAT OUR STRING
CONSISTS OF AN EQUAL NUMBER OF
A’S AND B’S.
 T HE MACHI N E S TARTS I N S T AT E Q 0 .
T HE MACHI N E READS TH E S Y M B O L O N T H E
TAP E U NDER THE HEAD.
I F T HE SYMBO L I S A 0 , T H E M ACH I N E W R I T E S A
B O N T HE TAP E AND M OVE S T H E H E AD R I GH T .
I F T HE SYMBO L I S A 1 , T H E M ACH I N E W R I T E S A
THIS TURING MACHINE 1 O N T HE TA P E AND M O VE S T H E H E AD R I GH T .
WORKS AS FOLLOWS: THE MACHI N E REP EATS S T E PS 2 - 4 U N T I L I T
REACHES THE END O F TH E I N PU T S T R I N G.
I F THE MACHI NE I S I N S TAT E Q 0 W H E N I T
R EACHES THE END O F TH E I N PU T S T R I N G,
T HEN THE I N P UT S TRI NG I S ACCE PT E D.
OT H ERWI SE, THE I NP UT S T R I N G I S R E J E CT E D.
 TUR I N G MACHI NES ARE A VE R Y PO W E R F U L
MODEL OF C O MP UTATI O N . T H E Y CAN B E
USED T O SI MUL ATE ANY O T H E R T Y PE O F
POWER OF TURING COMPUTER, I NC L UDI NG MO DE R N

MACHINES COMPUTERS. HO WEVER, T U R I N G MACH I N E S

ARE AL SO VE RY THEO RET I CAL . I T I S N O T
POS SI BL E TO BUI L D A P HY S I CAL T U R I N G
MAC HI NE THAT HAS AN I N F I N I T E T APE .
 WHI L E TURI N G MAC HI NE S AR E VE R Y
POWERFUL , THEY HAVE S O ME L I MI T AT I O N S .
F OR EXAMPL E, TURI NG MACH I N E S CAN N O T
SOL VE THE HAL TI NG P RO B L E M , W H I CH I S
LIMITATIONS OF TURING THE P ROBL EM O F DETER MI N I N G W H E T H E R
MACHINES OR NOT A GI VEN P RO G R AM W I L L
EVENTUAL L Y HAL T.
 TUR I N G MACHI NES ARE US E D I N A VAR I E T Y
OF THEORET I C AL C O MP UT E R S CI E N CE
APP L I C ATI ON S , I NC L UDI N G:
APPLICATIONS OF STU DYI NG THE L I MI TS O F CO MPU T AT I O N

TURING MACHINES PROVI NG TH AT C ERTAI N PR O B L E M S AR E

UNS OL VABL E
DESI GNI NG NEW TYP ES O F CO M PU T E R S
I MP L EMENTI NG C O M P L EX AL GO R I T H MS
 HER E ARE SOME EXAMP LE S O F T U R I N G
MAC HI NE AP P L I C ATI O NS :
COMPI L ERS: TURI NG M A CH I N E S CAN B E
USED T O I MPL EMENT C OMPI L E R S , W H I CH
ARE P ROGRAM S THAT TR AN S L AT E CO DE
WRI TTEN I N O NE P RO G RAMM I N G
L AN GUAGE I NTO ANO THE R
PROGRAMMI NG L ANG UA GE .
EXAMPLES OF TURING OPERATI NG S YS TEMS : TU R I N G M ACH I N E S
MACHINE CAN BE USED TO I MP L EME N T O PE R AT I N G

APPLICATIONS SY STEMS, WHI C H ARE P RO GR AM S T H AT

MAN AGE THE HARDWAR E AN D S O F T W AR E
RES OURCES O F A C O M P UT E R .
DAT ABASES: TURI NG M A CH I N E S CAN B E
USED T O I MPL EM ENT DAT AB AS E S , W H I CH
ARE P ROGRAM S THAT S TO R E AN D
MAN AGE DATA.
 HER E ARE SOME EXAMP LE S O F T U R I N G
MAC HI NE AP P L I C ATI O NS :
COMPI L ERS: TURI NG M A CH I N E S CAN B E
USED T O I MPL EMENT C OMPI L E R S , W H I CH
ARE P ROGRAM S THAT TR AN S L AT E CO DE
WRI TTEN I N O NE P RO G RAMM I N G
L AN GUAGE I NTO ANO THE R
PROGRAMMI NG L ANG UA GE .
EXAMPLES OF TURING OPERATI NG S YS TEMS : TU R I N G M ACH I N E S
MACHINE CAN BE USED TO I MP L EME N T O PE R AT I N G

APPLICATIONS SY STEMS, WHI C H ARE P RO GR AM S T H AT

MAN AGE THE HARDWAR E AN D S O F T W AR E
RES OURCES O F A C O M P UT E R .
DAT ABASES: TURI NG M A CH I N E S CAN B E
USED T O I MPL EM ENT DAT AB AS E S , W H I CH
ARE P ROGRAM S THAT S TO R E AN D
MAN AGE DATA.
 TUR I N G MACHI NES ARE A L S O U S E D I N
ART I F I CI AL I NTEL L I G ENCE R E S E AR CH . F O R
EXAMPL E, TU RI NG M AC H I N E S CAN B E
USED T O I MPL EMENT AR T I F I CI AL N E U R AL
TURING MACHINES AND NET WORKS, WHI C H ARE MACH I N E
ARTIFICIAL L EARNI NG M O DEL S THAT CAN B E T R AI N E D

INTELLIGENCE TO PERFORM TAS K S S UC H AS I M AGE

REC OGNI TI O N AND NATUR AL L AN GU AGE
PROCESSI NG .
 T UR I N G MACHI NES : ABS TR ACT MO DE L S O F
C OMPUTATI ON, P RO VI DI N G T H E
THEORETI CA L F O UNDATI O N F O R
C OMPUTERS.
AI ( ARTI FI CI A L I NTEL L I G E N CE ) : T H E
PRACTI CAL AP P L I C ATI O N O F ADVAN CE D
TURING MACHINES AND COMPUTER TEC HNI Q UES T O PE R F O R M

ARTIFICIAL TAS KS REQUI RI NG HUMAN - L I KE

I NT EL L I GENC E.
INTELLIGENCE C ON NECTI O N: TURI NG MACH I N E S AR E T H E
THEORETI CA L BAS I S O F C O M PU T AT I O N ,
WHI L E AI EXTENDS C O MPU T E R
CAP ABI L I TI ES TO MI MI C H U MAN
I NT EL L I GENC E.
THANK YOU