Lec 3.pdf

IM

Finite Automata Q E go F S 8 axe g sgai.net agdmingo Bae

M

WE

setae

1 M accepts

2

w

g

QxE p

reading

a

string

Eo

Icq

Icq

C F

w

q f

E na

q

n

a

NEE AGE

qin a

5

Is

if

we

f Cq ay qEQ

q proof put

E

in

start

AEE

S

exhaust input then

we

end in

I agree

p

proff

Icq

ny

ICE Cohn

a

on

By applying induction on length g of ly l e

g my

n

would

single symbol

PE

9

in stale

c

qEg

ly I

for

ye

2

j Cq

g Icahn y

ny

1829 n y

b n

for

LE ay

Assume

for

L yr

g e

e

l

to prove

By

Sican y yn

yn

nti

Cd my

Icahn

Ynyne

Ye

using

Covey

n

Ynet

sitting

g na

yn

Ynet

5 I 8 can Y Bede

CECE let

n

y 3 8 stem g

E

ICE

syn

yntD

a

a

Silsila Misa 8C stain 3

SC FC2 mg

a a

I

8C 8 CE 3 8 q nza y E Anny

9

find

for

FA WE

a

Lo

1

13

o

w

easy

µ very determinism Non helps

NO Is

0

E

ends in 01

determinism In case DFA

Non

of

has

SLE

9

Deterministic FA

exactly

a

is

each state q

i.e

for

out

arrow

one

unique a

symbol SC 9

NFA

a

ofNoslates arrow out

set

a

is

empty multipleStates

Input

00 I O

to

w

W

01090

K

q

stuck 90

9

0

g

qoµ

f

90

q

shine

O

90

000

to

i

q

9

Sm

O

I

oh

O

A

9q

Gr

Steele

Here ills is not exhausted

1

O

O

q

Yet he itis not accepted

Acceptance

8

when

execution path

there

ends

that

atleast

is

in

one

final

stale

accepting stele i e

final

tip fussibre exhausted execution palles either get stuck or state end in a non accepting not fond State or final stale t iffs not when

Rejection

all

exhausted

Cmo

Every string atleast n

f

one

L

NE L

have

should

L

in

acceptance

ballet All paths

are

Allease one fratt

rejecting is

accepag

NFA

Q 2

an

o

F S

Q

Jinx

S

SC q

as

Is

i

Stuck

stude

9

29 Ed

Q XE

reading w Base

case

19

i

Cq

Eca

E

a

nay

Is kz

Sp f u

Pi WE 2

slow

f

ice

n

z

WAEL

f

US bi

Cana

LCN

s

q

a

S Cpp

from E by

reachable

states

co

E

a

Sica

n

w NF 1 1 IcaoOne 0 the

of is find Skle State accepting

gray tree El 2,33 such is at last symbol W appears previously without any intervening larger symbol

WE

Sf µ eesthymdfs

last symbol I a

test symbols

31214423

gg

a

NFA is more powerful than DFA to DFA 2 How took'trwansforbm NFA

power

set

in