Scribd
Upload
71 views6 pages

Atfl Notes On 20-09-2021

This document describes the steps to convert a non-deterministic finite automaton (NFA) to a deterministic finite automaton (DFA). It involves constructing the epsilon-closure of each state, determining the transition function based on epsilon moves, and ensuring there is only one possible transition for each input symbol from each state. The resulting DFA has the same accepted language as the original NFA.

Uploaded by

MAJETY YASWANTH SUBRAMANYA SAI 19BCE0656
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
71 views6 pages

Atfl Notes On 20-09-2021

This document describes the steps to convert a non-deterministic finite automaton (NFA) to a deterministic finite automaton (DFA). It involves constructing the epsilon-closure of each state, determining the transition function based on epsilon moves, and ensuring there is only one possible transition for each input symbol from each state. The resulting DFA has the same accepted language as the original NFA.

Uploaded by

MAJETY YASWANTH SUBRAMANYA SAI 19BCE0656
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
You are on page 1/ 6

* -NFA that accept te ofstaiogs

Contthi eithen olHepeated one oh


mosre no o bmei d ot6 Hepeated One
one

mote no
of time
O1 1 o mo e

te mo

Sol C-NEA

(et ros3 ols

(
CoR)

e
ConveSion 1orn NFA to DA

ey no ooPottouwed hy ypr ne P
wed 's
foo y Pny no

MCto,, tonat,5, o, %3)


uth ene

e closune Cto) v,e3


Eclosuune,C,) 2 ,
clo fwe C2

Stept foCo
ConvUion
is the ini Hal
o eNFA
CCclo swre Co)
State o DFA the

C-clos e eCyo) Lo, T i s


ini tial Sate e DEA
o %Jo) closwe (&C9o,,u1O)
-clotwnes (o, o)U &(,)bt
-closuune vo
L9o,0)
S(19,tJ) e-cdoue(s(io,, 3,))
e cloLne C,)
9,

SC9%,21,) clekure (&(eo,9,i,a))


E-closwne (,)

Now,Nuo Setet ae , 9 ] , 1,J


stat ei fo DFA
ke alto ntw
They
Co
C9,7,-)= e-clotwne (i(,, ,))

o Cie dead tate)


SC1o,3,1, ) closeune (d (,,,},1))
-closwne ,

C1,1,) -ctosuwhe (& (,,3a)


C-closu ()s2ottt

Now, Le,J is the3d state D F


ind ot eoch input m bol fronm ,

C91o) 6-clotuone (d (? }o))

sCL3.71): e closust (4( ? , 3 , )

&'CC9,J,) e-ctose CiCÝ,3, ))

Tuan siHion table

C,3

C 2.
L,J
o,

1o

eI, is final state fa. ] is pselen a

SPcetes, att ae nal ckate


a

Jo/ e
Machine detcmip tion,
M
o , 3 , } , 23 4,o, So,
3)
ccloue(3)
-cto sue(,) : Lo t2
-closue Cv2) L ]

(onv e £jo

NFA
I in theiniHa
E-t lo suhe e9) t
fo DFA
S tate
initial state
is
so L9o
e-closuwe &(?9oj,a))
2 &'C J, a)
e closuhe (v,)

State is 9 V2]
:.N tw
Nous
&C1 , , a) 6-closwe CCo,, .
-cloSuhe Cd(oa) OC
Caa)
E closuhe ( , )
T o n si Hon Tble

(to ,

DHA

(9% , )

miscll eanous DFA Sum

1DFe
DFA cohose length divisib le by

DFA whose length divisible by 5

You might also like