M N Theorm L E

n
y C Ext
V 2 c E both
n
Rey and ar in
my
Lor
mot ya
L is
Regular Ru is finite
index
of

M sides are Lenses

eguinalmee
M is
ofnninthe stale DFA Pnoved
last lecture
To
prove M is unique

M D E S E F DRA L
M O E S Ed FY DFA
constructed in
MN
fmof of
191719 I Donetheom
if
if I 0184 are
quel
to fmone ME M

C Q f a n C I 2 SCEo.ms
9 shiny
 qc Q J Sl
Y e q
t
G Eoin

another
if 2
y
3 f blog q

may belong to save qui

valence
eless
so S Colo
y 1 8 Go n

TofindminimalautomabadFA
E S oho F
M L Q for

Is q t NEE't ftp.n
S CE n
iff is both accepting on
both non
accepting
p q are
distinguishisble
if g see 2 fatherClon is
State 8 q is not
final
n

on vice versa

all final non final states are

 all final fi al stal

distinguishable
for two states pit
any
Celculele Cp.a7 SCq.a
Criss
Y D8 are
distinguishable
then
qaneowsteiyushebeT
Taking.edu
kp.as.sce.ay cs.s mark
e as
of
not marked

create lost
D Yo E
if at a libertine
cis worked
them amerle all
the trains in
attu lost also

f Often for all

pains
states
181 n I K of and
all Symbols
in 2

O
 a

b
C
t at
d

Th k
a b e d e f g
b are

Gudalur

tt dJ
la.ge
 LE
J ID
lb.is I

Assume p q are
distinguishable
then phone that f q are

marked
by Algorithm
knot
nGE smallest that
Suppose
distinguish paq
induction on Int
containable statesLie refusing
prove M is tm.in stale DFA for LCM

To prove LCM LCM

To prove IQ 11in MY equivalence

classes
104 of RL

I I
if I I qui classes
of Rs
There exist too stules p q
in O
S t
p3 t
JFnwyJflqo.n
and
and
q
n
819mg p Rey
claim f q
if p of them g acts
Scp a final ix disfigure
Shoe find prey
in L
naff
Na is

ya ya is
invariant
not L
but Reis might
So contradiction
na
Riga
So
So
Is q E
1911 guinalenee
Classes
of Rs