Lec 6.pdf

RE

is

algebraic way of

an

Representing

Regular language

RE for have

set of atteest

binary strings which

all one

occurrence

001

substring

ng y

2001g wrongrep o B CorrectHoi

set an

o 001 Cool Lot

1

of

C

if

of binary strings that represent integer that as a power of 4 c4 co.oy utmost

binary string with consecutive L's

E

binary I

string not o

ii

f

fourof

It D

Ethel

to

4.0

one

containing 1

010

1

Tolonine

op 11 l

Equivalence Lee s

I

of RE

E NFA

Boom

PraEos mersion

e

RE

ET

C NFA 9o

E

we

v a

C

b

me

iffy

LEDA

te

I

If

HowtoconstructaREfnomDFt DFA

D E S 91 Ez

M Cg

Eo F s

Ries Rt for

Em

M

oh

Lig

wfjcqp.co

Mig

O

Rij R Now

Leigh

RE

is

g

I

Ep

S

E

hi

RIJ need to

fi goes to Ej

w

Ej

for Mij

just

we

9g

know

from ou

state 2T

input

states Ea que

using 9

Rij

n

Rigo

Rigo

x

O

w

C a f

Azt Eta e eat

Riga

Rig

B costs

of

prig

tat

gag

Al

At

if i

transitionfrom99105

no

Rijn given find

wtf

Rigo

Rift Rifai

Rijn

u

Rig

Rufina k Rutij

REai

rii.us

us

Rue Now

we

have we

Rijk can

Ut

Rijk R easily find

be

T find

0cm's another

ago