Finite Automata Q E go F S IM

8 axe gsgai.net agdmingo

Bae setae

M WE 2 1 M accepts w

QxE
p
g
reading a
string
Eo w C F

Icq E q
Icq na f q n a

NEE
AGE
qin 5
Is if we start in stale 9
a f Cq ay qEQ exhaust input n
q AEE then we would
proof put E in end in
p
S I agree on a
single symbol

PE Icq ny ICE Cohn g

c
my
proff By applying induction qEg
on length
of g
ly l e
 ly I e
g L yr ye
for e 2

j Cq ny g Icahn y
1829 n y By

for b n
Assume LE ay yn Sican y yn

for l nti
to prove
Cd my Ynyne Icahn
Ye Ynet
using
Covey n
g na sitting yn
Ynet
5 I 8 can
Y syn
yntD

Bede CECE n E ICE a

let
y 3 a

8 stem g Silsila Misa

8C stain 3 a

SC FC2 mg a
 8C 8 CE 3 I
8 q nza
y
E Anny

9 find a FA for
Lo WE o 13 1 w ends in 01
easy
NO µ very
determinism
0 Is Non helps

Non determinism
E DFA 9 SLE a is
In case
of unique
Deterministic FA
i.e each state q
has exactly one arrow out for a

symbol
NFA SC 9
ofNoslates
a is a set
arrow out
empty
multipleStates

Input to 00 I O w 000 90
to
W i q
01090
K 90 9
q
stuck 90 g
f Sm
0 q
shine
9 qoµ O O I
 oh O O O 1
A 9q
Gr
Steele q
Here ills
is not exhausted
Yet
he itis not
accepted

Acceptance 8 when there is atleast one

execution path that ends in final stale
accepting stele
i e
Rejection when tip final
fussibre all
exhausted
execution palles either get stuck
or end in a non state
accepting
not fond State
or
final stale t iffs not
exhausted

Cmo
L should have
Every string in an

atleast one acceptance

n L ballet
All paths are
rejecting
f NE L Allease one fratt is
Jinx
accepag
NFA Q 2 o F S

Q
 S Q XE 29
SC q as
Ed

Is stude Stuck
i
9 co states reachable from E by
reading w s
Base case i 19 E q

Cq a
Is kz slow n z

S Cpp a
Sp f f ice WAEL

Eca nay u
f
Cana US bi a

Pi E Sica n

LCN WE 2 1 IcaoOne
w NF 1
the
0
of is find Skle
State
accepting
 gray
tree

WE El 2,33 such is at last symbol in

W appears previously without
any
intervening larger symbol

last symbol I
Sf µ
a
test symbols
eesthymdfs

gg 31214423

NFA is more powerful than DFA

a How took'trwansforbm NFA to DFA 2
power set