0% found this document useful (0 votes)
44 views6 pages

Trabajo

1. The document defines a finite state machine M with states S={s0,s1,s2,s3,s4} and input symbols Σ={a,b,c,d}. It gives the transition function f and final states T={s3,s4}. 2. It provides examples of words w and w1 that are accepted by M by applying the transition function f repeatedly. 3. An equivalence relation Rc is defined on the states, partitioning the states into equivalence classes {s0}, {s1,s2}, and {s3,s4}.

Uploaded by

Bman
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
44 views6 pages

Trabajo

1. The document defines a finite state machine M with states S={s0,s1,s2,s3,s4} and input symbols Σ={a,b,c,d}. It gives the transition function f and final states T={s3,s4}. 2. It provides examples of words w and w1 that are accepted by M by applying the transition function f repeatedly. 3. An equivalence relation Rc is defined on the states, partitioning the states into equivalence classes {s0}, {s1,s2}, and {s3,s4}.

Uploaded by

Bman
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
You are on page 1/ 6

1)

a b c d
M=<S, , F, s0, T>
s0 s2 s1 s3 s4
S= {s0, s1, s2, s3, s4} s1 s3 s1 s2 s0
= {a, b, c, d} s2 s4 s1 s2 s0
T= {s3, s4} s3 s3 s1 s3 s4
F={fa , fb , fc , fd} s4 s4 s2 s4 s3

s1 s3

s0

s4
s2

2)
f : S S
w0

w0 a 4 dc 2 b 3 cdc
f f 4 2 3 f f f f f f f f f f f f f
w0 a dc b cdc c d c b b b c c d a a a a

3)
f : S S
w

w a4
f f 4 f f f f
w a a a a a

f ( s ) f 4 ( s ) ( f f f f )( s ) f ( f ( f ( f ( s ))))
w 0 a 0 a a a a 0 a a a a 0

f a ( f a ( f a ( s2 ))) f a ( f a ( s4 )) f a ( s4 ) s4
s4 T w L( M )
w1 a 4 cdc
f ( s ) f ( s0 ) ( f c f d f c f a f a f a f a )( s0 ) f c ( f d ( f c ( f a ( f a ( f a ( f a ( s0 )))))))
w1 0 a 4 cdc

f 4 ( s ) s
a 0 4

f ( s ) f ( f ( f ( s ))) f ( f ( s )) f ( s ) s
w1 0 c d c 4 c d 4 c 3 3

s3 T w1 L( M )

4)
a b c d
Rc ( si , s j ) S S / e : ( si Rc s j f e ( si )Rc f e ( s j )) s0 s2 s1 s3 s4
___ __ __ ___ __
s1 s3 s1 s2 s0
M S , , F , s0 ,T s2 s4 s1 s2 s0
s3 s3 s1 s3 s4
s4 s4 s2 s4 s3
___ ___ ___

S = S s0 , s1 , s 3
Rc
s0 { s0 } a b c d
___

s1 s1 , s2 = s2
___ ___ ___ ___ ___

___
s0 s 1 s 1 s 3 s 3
s3 s3 , s4 = 4
s ___ ___ ___ ___ ___

s 1 s 3 s 1 s 1 s0
T T { s3 } ___ ___ ___ ___ ___
RC
e : f e F s 3 s 3 s1 s 3 s 3
f e ( si ) f e ( si )

s1
s3

s0
5)
w a4
f ( s ) ( f f f f )( s ) f ( f ( f ( f ( s ))))
w 0 a a a a 0 a a a a 0

f a ( f a ( f a ( s1 ))) f a ( f a ( s3 )) f a ( s3 ) s3
s3 T w L( M )
w1 a 4 cdc
f ( s ) ( f f f f f f f )( s ) f ( f ( f ( f ( f ( f ( f ( s )))))))
w1 0 c d c a a a a 0 c d c a a a a 0

f 4 ( s ) s
a 0 3

f ( s ) f ( f ( f ( s ))) f ( f ( s )) f ( s ) s
w1 0 c d c 3 c d 3 c 3 3

s3 T w1 L( M )

6)
G ( S , , s0 , )
s0 as1 s1 as3 12) s3 as3
S s0 , s1 , s3 1) 7)
s0 bs1 s1 bs1 s3 bs1
a ,b , c , d 2) 8) 13)
s0 cs3 s1 cs1 s3 cs3
3) s0 ds3 9) s1 ds0 14) s3 ds3
s0 c s1 a 15) s3 a
4) 10)
s0 d s3 c
5) 11) 16) s3 d
17)
6)
18)

7)

w a 4

s0 1 )
as1 7 )
aa s 3
12 )
aaas 3
16 )

w 1 c dca 4
s0 3 )
cs3
15 )
cd s3
14 )
c dcs 3
12 )


12 )
cdcaa s 3
16 )
c dcaaaa

w1 a 4 cdc
s0 1 )
as 1 7 )
aas 3
12 )
aaas 3
12 )
aaaas 3

14 )
aaaacs 3
15 )
aaaacds 3
17 )
aaaacdc
8) w=a4
s0

s1

s3

s3
w=cdca4
s0

s1

s3

s3

s3

s3

s3
Oldecop, Francisco
UNSJ-FCEFyN
Reg: 15801
03/06/2011

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy