SLXC.C.E Page No.

Unit -7

Conrersion to a DyA

Subsetconsructt on algorithn

The qeneral idea, behind tha subset

constructton is tat each State of the
Costrueted to Set oy
Correspondi
NA Btat es .

Input: NYA State

Output DA
Method

e closur e ) s e t a NA Stata reachake

State e alona.

more-CT a) Set State

hich there is nansitton
Nànput Syabol a fro m Some

Subset Consiett'on
ony toe
inibaly state tò dstates and it id Cnmes
while (toere ia an unmasted State Ten Dtt)
 Stach onto
spush push
frog edge anklita state
u eåch for
empty tath (s whila
M to(T) suoe Cco tnitalize
T.onstacf Push
all
cloBu
Te G
DtanTa]:U
Dstate.
asan. 'add
U
bo
Stateomarsedi C4(U
Dstate) nnot
Ca) (mnore
:Gclosure
symßol inputfor(each
)}5 a marhT:
St.X.C.C.E
 St.X.C.C.E Page No.

Regalas Expreson alb y abb

Sbatt
b

’ The Stast State

to G clo&use CA stast State ).

tan3alinput =a,b?
Gclosue (mora
( CAj J=
eciesuve Cmora.Co, lies4,73, a))
ecoSuse C3 s)
3,6, t, 2t)&»2, 3, 4,6,t,8sR
 Page No,
SLX.C.C.E

GcLasuva ( move CAb):

Dtran LAJ. c

GclosuLoe Cmore (B,a))

eclosuse C3G) (B)

D-tsan [B,a] B

Gclosu be (more CBbT)

GiloSure Cmove CU A3, 446t,8)L

Dtran/ By6|D
e closuve moYe Ccia)
=ecCosure Cmore Ciss 4S,bt) a)
= eclosuve (3,&)
St.X.C.C.E Page No.

Gclosuve nore, C9b2)

eclosuse (morz Ciat S,b,t)&)
AecoSaae C5)

DtranCc6†= C

Eccosue (move CDa3)

=éclosu og (moe Cli4,5,6t4)a)

JDtsan CD) =B
GclosLIe (moe D»b))
5.Gclosu se (more Ci2,9s,b,t, ?), 6)
Cilalase (5,lo) igi

D+ranLD 6}- E
Eclosuse (more (E,a)
- eelosusE Cbaore (.14 4sy btlo))a)
= telo Su DE C 3, ) B

Deran fEsa]-B
 .
B D
B
Dri 8
B A
states
pSynbe)
Table Toasition
NA
) State
Cconains State ’inal
Fin al
State
[Esb]-c Diran
[5)
more Sute lo ee =
(more(E6). eclosuoe
SLX.C.C.E
 St.X.C.C.E Page No.

Tiransition Diaqsam
b

Mininni taton
umber States
inimizn
M

Eguivalente Me ttods ) 3u1,

nseeateptingStaty

Equiratenig.
Gmove (73a)F (Final state)
and. more Cy9f
then state
and rmive Cs, b)E
Tand Sare eqitl
 B
A,
alanie D
(8.b)>> Move
set Same Both ?CA))
B More
n
*Meve
B a) (B,
se' inset MMore(A
Same BBeth
in a) ,
1Parti
tion
2. Valana3Eqai
6? D7
B,c, A,
of
Equlvalente»Leset
stat Final Beta o
atutioni
E
B
D B
B
b Stateg
Symbo/ tp
tionTransi
Table
SLXC.CE
 Page No. 5

Move A,a ’8 Bo1 Set equlo)

MoreCCad Bis6
Sane set
more CASB)cBoth
io quivalanie
More Cc, b) C
Therefo s e . G aoe One equi valan

A jD
Same Se
Set

More;. CDyas) 8 cquo

More CAb) c Jrtesent Setco
Mo ra(D 6) >Eeguce)
.
nat
Therefoe Di
A B)CSriy,t,

.29uivalaae.

4iralanu)
A, B
Same
morg, LB438
 Page No.
St.X.C.C.E

more CAB) eAHent t cn

mare (3.6) D) equ ci?

Same Set te
mO re (C)a)B

move.CC ) c esuli)
Aand QIe equivalane

en'valanle4.(as

3
A,t nore ame cto
no re CCya)

CA,b)c Same See o

mo re Coa:
 SLX.C.C.E Page No.

onsecu tt re equivalanee are SAme

Now Btate and

Set 2tate A and
kle Can mininml
State Ac'
tlitt meu

Stles
lminimizud Siaty
xles
AC, B, D,
ransiion table.
States
b
B
D
B
B
B AC:

Transitton iagsam.