Bg Does theme exist a minimal DFA

if it exists is it unique

find equivalence ref of finite index

on 2 1

Idyhinetheorriy
Language a
regular is then Fa
equivalence set of finite index
and such a selk
defines minimal DFA
and equivalence classes are its
nodes

L E Ext
se
Rey fzEE RZ and
ye
either are both in 6
on neither is in L

L
regular
M DFA
n Rm gcqo.nl Slow y
y
index Rm of states
it's of
a finite index because
no
of slates in his finite
 The following statements are equi
Malenti
D L is
b
regular
L is union Some
classes
of equivalence
invariant
of a sight
quinalenel relation of finite
index
9 let eguin rel's RG define
t
by Krug e
g za
in when
ng is 6 exactly
C L then Reis of finite
y3
index
R.iqfiavt nRy ngRyz t2EE
To knoue Rm is tight

invariants
coho ND Shan S 3
SCSCEo.gl s2
SLE
yD

Assume to Gnome
R R S R refi
 n R y R is refine
n
Ray merit
of Rm
Suppose E is an
equiv reletion

satisfying
TIC E is an
refinement f R
class Eris
every gain of
contained in an
quiv Class
Re
of
neg
sin E
n
Rey
is
finite index
Re is also finite index

TF Rt is
www.ght invariant
torndefineners of SFF
fnoff By deft of Re

M D E S go FY

Q grin Chess of Ru
classes
q equiv containing
 even class cone oy
empty string
F E ti Iquivalenee
n is
ini
class
g
gLoy a nay

S Eng a
Eyed yC
a

Emad Cyay Due to right

invariance

L L of M
II of M
Misraiomdueta

f Colo a Eng
KEL
ERIEF
off
he 0 10
0

It
ot o
 I 0J
ea fo
Ey O 00ft
01 0

ed 01 01
Ec 1007 1
ee 0 10 OF
Cf 0 10 1 eyet

1 ee U ee U ed
uRG iff have no 1s
may
ie Oued's
u more than Dre
Is
quaralence classes for Re
9 OH
t
fond stale
artunion
ez 0 10
I 0 7
e TD
 Minimal auto webs is

a
1
cog CD AD
afore automate is
To prove and
minimal is
unique
for the givers language

Tag The minimum automaton accepting

a L is unique upto
language
an
isomorphism
is
i e renaming
estates and given by
of M
proposed in earlier
theorem

M
M D E S F
1017104 n.EE
all
7 8 go a genes cry
Ep M
some fluivalene club in
Il go EyD of
S coho nd S l go Ey
To Prome Eng Cyd
 y
Miniminalgorithin
DFA M CD E S Eo F

b q off each infurt sting a

flq n
ftp.n
is an us
an
accepting
Skee aecysing
Fate

is
distinguishable from 2 if
SC fan F
f n D is in
and S C h n us not
converse