=5 hes abcba W

w3 then
denote i
ength Caled is
lr Sy nwmbe the Lengtt
a of
(Iw): sting
(EFS;lon) edenoted
by is
is 1t
ab,ba bbaa,
Stain a
is 4101
Caled shatek
s Soe
n sequenee
of Bnte A
diqits,2,3}> = aaN
sel lete Cale Loes ->
alphabe
omp nonfnite, phabet a edCall is
A
a. nmbe (E): AtFhbet *
o teteA, Any
caled Tocic ne emeNeNE Cmalest
FxSybolThe *
to
ns emit ock ng
ldì biFundementae Chap
1.
of the IntducNor
to R20o2 MCA
 debeted
is Reresin K
w
LA om andv
tength that
ic
he
-e, bAreg acb, {aqa, faa Uphabel eing
Sing-wy ,bb,ce,
aphabe bbb Anoh
bba,
b, that (2).
beb, Ccc,
aa, as, they
ab,
alhabel bcb, ac,
ab, aac, ba, btaineo
baa,
bc,
ba, bcc-- aba,
(). Aeesse
éele.in ca,
aaa aca, cb
(uniny abb
appen
bb,abb
,acc, da
length
abc
 - ,1, 11,111,

kleene Hus (poS;h vo) claseso )::

al
n any emth vee atphabe ercept
MM
alhab el it is densted
Ex 1

=L0, 1, 00, (o,oi, ,oo0,l o t

Substng
14 the sting v Contain eo tiy
an otner Staing wthen Ohe sne vVis Cale

L V W and wo101 he

A SubStAng
ot begining Syrsbot
ie Caued a pef.
heoSe6e
(n+1).
Ex)e we abc
eistho Sel f preice,
hen ea ab, abct
2) Lel w fabb
4 refxes
$E, aa, ab, abbt is ee Sel
 LAG1

ASubstim1

Fn, Lel w abc?

the E, bc, bc? is

PalidaDme:
A palindeme is a Sting
which is Same when eod in backa
direcso:
hen
Here

CL):
Lagge Asel op fchaings
Serge atiwee kin of
1Stings taren rem
shabet s cated a
Language ay be Hnite oA inAnte.
Sa,o
he L= a b
b, b, aab
t is innite Languag
Hhen L=$set et tinge ending wit)

alto inSnite Longuase

 2) LA =a,b
hen L =} Set of Stng st lenth 3t
aab, aba baQ,abb, bab bba bab

ba, bb
alo nite

esorase
1.e. Cuv)w ucvw)
Lings,he

tndiidua lengh
j.e |uV |Ut|V
2) Conc ateno stsn s not Commutasve e
LangugA
tolesine seen bosic s p e e eon Lanuse:
Concatnaen (roduct) o Lnguael (L-)
Lee L , - a b ,n o
L
abeL and c1 eLat

w weL}
 3) kIeen (Stas) clesuse OfLunguage

Unien of Languges (L,Ule:

-

L,UL, wweL, 02 weles

CL,n):
L,nL,=w weL, and We L
 utemata !-nite stmachine7
Finite Autometa is a mathenatica
model a4f system (nachine) wit ceh tain ngp
Md it is procesRed thruh vaius intelmediet
State
ound ina
findy qives eAain oud-.
pnite Automata is dehned a5-tupleg
whee
2= set o tnite stehe

Tornsion funcio
Qx;
Tnicsta) See
F sel na tates

Cnie Automea can be epeen by

tolousing ttee wey
oanon T e(m

) oan Sihion diagra

e drece aph bottheHces
a a p h in which vessces inoicehee Stees
and ed4f inai Cete tocntions tgn Bne Stase
to anethe

Stee nal
Stast tate indicated by fab Camming in from
nethee anal Anal etote indicated hj drae
douhia
CirUe.

-Tbhe tehe wich Com2ito

CosTegnd to Stetee, Counne Cerlpon
to e inpu Symbes entieg Cosregpond to
Ahe eot tetee,te Sta Stete is masked
WH and Stee maced ttth
na stee *
Fer example Concieles the telousin femio
diagrag

he tranH tase t r e abore transiti

dagao(Automata) is
Stehe Inpue>

ranson funson:
Then

o(cuent oe inpt (ymbo ) = nect state

the transicn fnes o of the abere

 tetie Can be

Pinie Autoa
fox deimin diita Ciruite
)
i intomn eeange
fo
i) foe deztnim leica anaysis of Compliee.

Autona.

Gnite Automad
Dteminisic nte Automata | DEA
- dereminisHe nite tutomata NFA]
Deteminiic Hnite Automate (DFA):
The tnite Automate in whichtnsihiom
deemniic and ttee
Spedhc nput CUsAprnt RAee to
net Stere.
 26,2 Hebe
Da,b
e for DfA a
Stae. inal One ha 1t
tae neAck totte Cussent
State,CAccepsn
State ral =
chom fun oans
on
where
tupe 5 detneo icDEA
 epe acc Not
o0,
60,1bo1oto, (4)
|60,
00,00,00o0,
cvaud,
Stg accRpt Hat DEA Conshuct
a en Fb&.
(r
accet DEA a
hatDeinCConee
 12

a DFA hal accept L=we(o,1)

o in whas 1inmediatey to its ifht

Dead/ Torep Stae

Stats with ab

DRadrup stae
 Nen-eemini c nite Automata -CNEA:

4is detneo as,

N(0, , d, Lo,F)
(Shese

TnihaStest State

* The iCfeence bern DEA NEA :

NEA
1: the transis en is degeminahethetaniho i non-desesministic.
Ar 1t hes aa sinepath for nay hare Sevasud patsfa
a
Single isqut trom,Shehea
n input on a State.
3. 1t has more n umbe 4 hal e nwmbes tae
Gees then NFA. h n DEA
4. It has enetna1T hoRemore then
Sate.
S. 1t is more ditfiw t to 1t is eniy to dein ag
ConrazetotNFA CompR t DEA
desisn a
6. Lt'proides ont 1t Prndes more than one
Gate tranihon a

ven ingeut.
t ee is nees to to Thee s no nee to

reguiresl.
 3

state orhe set yabas': n>o0faba: n>o,.

fb esi a EA at aceepte L=(ao canb)).

a,b
 to accept sterg CuntainiM
he

Accepteunce e Sv
he s i n s aceepted a

StasKng C l e inisa) State and ende in

an acctpingc inal)tate attes Aeeoi
Aeasing
iie A Stalng W s accepte by DEANEA
Cca, , d, 2oF) ift

languape L is accepted by DFA JNeA

wez an dceo, weE
A Stin wis not accepted bi DEA NEA

the languae Lis not accepted bye DEA |NEA

L= fw we and deow)¬E
 vali
ac ee
lonaae
A hat
givem
cmachine)
a eXane
Fer
in
dece
roducesl )NF
A
is