_auto
|
|
- せぴあ ありはら
- 7 years ago
- Views:
Transcription
1 0 0 pdf pdf Turing mchine
2 . set 0 element, member A A A finite set infinite set A A A A crdinlity A A {} {,,, } {,,, } x P (x) {x P (x)} P (x) x A Q(x) {x x A Q(x)} {x A Q(x)} N { N b =b } A B A B A B B A B A) A B A B subset A B A A
3 A B A B B A A B proper subset A B A B A B A B A B A B = {x x A x B}. A B = {x x A x B}. A B = {x x A x/ B}. 0 A B = {(x, y) x A y B}. A = {B B A}. A B A B A B A B A B A A = {,, } B = {, } A B = {(, ), (, ), (, ), (, ), (, ), (, )} A B b (, b) A B A m B n A B m n A B = A B
4 v v v v.: m = n = A B m n = = A = {,, } A = {, {}, {}, {}, {, }, {, }, {, }, {,, }} A A A A A A A m A m A = A A A = A = = B = B = { } C = {} C C = {, {}}. grph G vertex, node V edge, rc E e v, v ( ) v v v e strt vertex v e end vertex v v predecessor v v successor G = (V,E ) V = {v,v,v,v } E = {v v,v v,v v, v v } 0. B B = {, { }} B B = {, { }, {{ }}, {, { }}}
5 E E + E id E * E id id.: G = (V,E) v v E v v E undirected grph directed grph G =(V,E) v v, v v,...,v k v k G v v k 0 pth v = v k closed pth, cyclic pth L v V l L f f(v) v lbel e E l L g g(e) v lbel lbelled grph
6 tree 0. root.. prent child, children ncestorr descendnt lef internl vertex. E,+,,id E + E +EE EE+.... E E 0. D D domin D codomin, rnge D function D D D D type f D D f : D D lbeled tree structure. rnge codomin codomin rnge
7 f D D type C D f(d ); D D D D D D f C D f(d, D ); D D D D D D D C C return C D D D D C C bit D
8 . / / 0 symbol / / symbol string 0 string lphbet Σ Σ={, b, c} bbc bbbccc Σ Σ u u length bbc = bbbccc = 0 empty string ε ε =0 0 u v uv u v conctention u = m v = n uv = m + n bbb bbb
9 ε u uε = εu = u 0 x +0=0+x = x, x = x = x n } {{ } n 0 n u n uuu } uuu {{ } u n n u 0 = ε u n = uu n (u) n u v w u = vw v u prefix w u postfix bbc ε b b bb bbc proper 0 bbc bbbccc bbc= bbc. Σ Σ forml lnguge lnguge : L = {@ n+ n 0} @@@@@@@, } ()
10 @ : L = {@ n n } @@@@@@@, } Σ ={0,,,,, } 0 L = {n n 0 } = {,,,,,, } 0 {ε} {ε} u L membership L Σ Σ Σ Σ Σ Σ Σ Σ 0 / 0
11 H F R.: () 00 (b) 0 (c) (d) (e)
12 . 0 H F R... H F R HFRHHF H 00 F 0 R H 00 H 00 F 0 0 HHFFRF H 00 H 00 F 0 F 0 R F 0
13 0 HFRHHF 00 0 u v w. u H F R 0. v H FF. w H F... u R u u v w w u v w uvw L J L J = {uvw u {H, F, R},v {H, FF}, w {H, F} }
14 L J = {uvw u {H, F, R},v {H, FF}, w {H, F} } (H F R) (H FF)(H F) 0. L L conctention L L L L = {xy x L,y L } {b, bb} {, ccc} {b, bb}{, ccc} = {b, bccc, bb, bbccc}
15 {ε} L L = L =, {ε}l = L{ε} = L L L n L n L } L {{ } n L 0 = {ε}, L n = LL n (n ) L L L Kleenen closure L = L i = L 0 L L L... = {ε} L LL LLL... i=0 L L L L Σ Σ Σ n... n i Σ... n Σ n Σ n Σ... n Σ Σ Σ 0. Σ regulr expression r r lnguge L(r) L(r). Σ L() ={}. regulr expression
16 . ε L(ε) ={ε} ε. L( ) =. r r (r) L((r)) = L(r) (). r r r r L(r r ) = L(r )L(r ) r ε L(r r ) = L(ε)L(r ) = {ε}l(r )=L(r ) r ε L(r r )=L(r )L(ε) =L(r ){ε} = L(r ) 0. r r r r L(r r )=L(r ) L(r ) L(r r ) L(r ) L(r ) r r r r. r r L(r )=L (r) L(r ) L(r) r r 0. r r + L(r + )=L(r)L (r) r + r () > > + > > Σ={H, F, R} (H F R) (H FF)(H F) L((H F R) (H FF)(H F) )={H, F, R} {H, FF}{H, F} 0 (H F R) H FF(H F) H F R (H FF)(H F) H F R H FFH F
17 . Σ ={, b} : ( b) Σ L(( b) )=L( b) = {, b} =Σ : ε L(ε) ={ε} 0 : L( ) = r r r L(r ) =L( r) = L(ε) L( ) ε L(ε) L( ) : L() ={} : b 0 b L(b) ={}{b}{} = {b} L(r ) =L(r)L( ) =L(r) = L( r)
18 : ε b ( b)( b) + Σ {} L() {}. r L(r )=Σ L(r) r : 0 L( )={ i i 0} { i i } + { i i } + + : b b L( b )=L( ) L(b )={ i i 0} {b i i 0} : (b) b (b) n = bb...b L((b) )= {(b) n n 0} = {ε, b, bb, bbb,...} 0 0: (b b ) b b 0 ε bbb b bb... () b () b 0 b
19 : ( b) ( b) L(( b) ) ={u u {, b} } : 0 { n b n n 0} b b N { n b n N n 0} ε b bb bbb... N b N N b { n b n n 0} b { m b n m, n 0} m n L( b ) { n b n n 0} 0 : 0 ( )(0 ) Σ={0,,,,,,,,, } N N = N
20 :(0 ) +.(0 ) (0 ).(0 ) + Σ={0,,.} :(+ ε)((0 ) +.(0 ) (0 ).(0 ) + ) Σ={0,,.,+, } r r L(r )=L(r ) r r equivlent r r r r r r L(r r )= L(r ) L(r )=L(r ) L(r )=L(r r ) 0 Σ={, b} () b b () ε () ε () b b () () () ( b) ( b ). r =(0 ) +.(0 ) (0 ).(0 ) L(r )
21 : : ε- : : : C.: 0.
22 ε- ε- ε- ε- C C r L(r) C. ε- ε- regulr lnguge
23 C
24 0 0. deterministic finite stte utomton / n n / n n n = n ( n) ( n)..
25 R q 0 R H q F H,F R q H,F.: 0 stte trnsition grph stte trnsition digrm. q 0 q q stte H F R q finl stte. initil stte. q 0 HFRFHF HFRFHF q 0 H q F q R q F 0 q H q F q 0 q 0 ccepted q q HFRFHF rejected FFRFHRF
26 q 0 F q F q R q F 0 q H q R q F 0 q q q FFRFHRF. L J. L J. L J M (Q, Σ,δ,q 0,F) Q Σ δ δ : Q Σ Q trnsition function q 0 Q F Q δ ˆδ : Q Σ Q ˆδ(q, ε) = q, ˆδ(q, u) = ˆδ(δ(q, ),u) Σ u Σ δ ˆδ u Σ ˆδ(q 0,u) F q 0 u ˆδ(q 0,u) u M M L(M) M
27 L(M) ={u Σ ˆδ(q 0,u) F }. M J M J =(Q J, Σ,δ J,q 0,F J ) Q J Σ δ J F J Q J = {q 0,q,q }, Σ={H, F, R}, δ J (q 0, H) = q, δ J (q 0, F) = q, δ J (q 0, R) = q 0, δ J (q, H) = q, δ J (q, F) = q, δ J (q, R) = q 0, δ J (q, H) = q, δ J (q, F) = q, δ J (q, R) = q 0, F J = {q }. Q J Σ F J M J =({q 0,q,q }, {H, F, R},δ J,q 0, {q }) M J L(M J )={u {H, F, R} ˆδ J (q 0,u) {q }} HRHF ˆδ J (q 0, HRHF) ˆδ J (q 0, HRHF) = ˆδ J (δ J (q 0, H), RHF) = ˆδ J (q, RHF) = ˆδ J (δ J (q, R), HF) = ˆδ J (q 0, HF) = ˆδ J (δ J (q 0, H), F) = ˆδ J (q, F) = ˆδ J (δ J (q, F),ε) ( F=Fε) = ˆδ J (q,ε) = q ˆδ J (q 0, HRHF) {q } = F J HRHF
28 q 0 q,b 0 q,b q 0,b,b () () () q 0 q q 0 q b,b b,b () q,b () q,b q 0 b q b b q,b q q,b ().:. Σ={, b}. : L(( b) )=L(M )=Σ 0 Σ = {, b} = {ε,, b,, b, b, bb,,...} Σ M. () M = ({q 0 }, Σ,δ,q 0, {q 0 }) δ (q 0,)=q 0, δ (q 0,b)=q 0.
29 q 0 : L(ε) =L(M )={ε} 0 M. () M =({q 0,q }, Σ,δ,q 0, {q 0 }) δ (q 0,)=q, δ (q 0,b)=q, δ (q,)=q, δ (q,b)=q. q q q q q q ded stte : L( ) =L(M )= M. () M =({q 0 }, Σ,δ,q 0, ) δ (q 0,)=q 0, δ (q 0,b)=q 0. 0 q 0 : L() =L(M )={} M. () M =({q 0,q,q }, Σ,δ,q 0, {q }) δ (q 0,)=q, δ (q 0,b)=q, δ (q,)=q, δ (q,b)=q, δ (q,)=q, δ (q,b)=q. q
30 : L(b) =L(M )={b} b M. () M =({q 0,q,q,q,q }, Σ,δ,q 0, {q }) δ (q 0,)=q, δ (q 0,b)=q, δ (q,)=q, δ (q,b)=q, δ (q,)=q, δ (q,b)=q, δ (q,)=q, δ (q,b)=q, δ (q,)=q, δ (q,b)=q. q : L(ε b ( b)( b) + )=L(M )=Σ {} 0 0 L(M ) Σ {} M. () M =({q 0,q,q }, Σ,δ,q 0, {q 0,q }) δ (q 0,)=q, δ (q 0,b)=q, δ (q,)=q, δ (q,b)=q, δ (q,)=q, δ (q,b)=q. M M M M M M M M L(M) M M. Σ L() ε b ( b)( b) + {, b} 0
31 ,b q b 0 q () b b q 0 q q () q b,b q 0 q b b () q,b b q 0 q b b q 0 q b b q (0) ().: : L( )=L(M )={ n n 0} 0 M. () M =({q 0,q }, Σ,δ,q 0, {q 0 }) δ (q 0,)=q 0, δ (q 0,b)=q, δ (q,)=q, δ (q,b)=q. n n. () q 0 q 0 q { n n } ε 0 : L( b )=L(M )={ n n 0} {b n n 0} 0 0 b M. () M =({q 0,q,q,q }, Σ,δ,q 0, {q 0,q,q }) δ (q 0,)=q, δ (q 0,b)=q, δ (q,)=q, δ (q,b)=q, δ (q,)=q, δ (q,b)=q, δ (q,)=q, δ (q,b)=q.
32 q q n b n n q 0 q : L((b) )=L(M )={(b) n n 0} b M. () M =({q 0,q,q }, Σ,δ,q 0, {q 0 }) δ (q 0,)=q, δ (q 0,b)=q, δ (q,)=q, δ (q,b)=q 0, δ (q,)=q, δ (q,b)=q q 0 q q 0 (b) n n 0 0: L((b b ) b )=L(M 0 )={u Σ u } 0 b 0 ε bbb b bb... M 0. (0) M 0 =({q 0,q }, Σ,δ 0,q 0, {q 0 }) δ 0 (q 0,)=q, δ 0 (q 0,b)=q 0, δ 0 (q,)=q 0, δ 0 (q,b)=q. q 0 q b b (b b ) b {u Σ u u b } 0 : L(( b) ) =L(M )={u u Σ } u Σ u M. () M = ({q 0,q,q }, Σ,δ,q 0, {q }) δ (q 0,)=q, δ (q 0,b)=q 0, δ (q,)=q, δ (q,b)=q 0, δ (q,)=q, δ (q,b)=q 0.
33 q 0 q q b q 0 q 0.. R q 0 {uv u, v Σ } 0 b b bbbbb :. { n b n n 0} N N =,,,... { n b n N n 0}. C C 0 b chr ASCII b b chr [] chr in[] 0 M 0. int M0(chr in[]) M 0 goto \0 q 0 q 0 \0 q q 0
34 int M0(chr in[]){ int n = 0; } q_0: q_: switch(in[n++]){ cse : goto q_; cse b : goto q_0; cse \0 : return ; defult: return -; } switch(in[n++]){ cse : goto q_0; cse b : goto q_; cse \0 : return 0; defult: return -; } int min(){ chr* input = "bb"; printf("\n%s : %d\n",input,m0(input)); }.: M 0 C goto - min input M0(). goto goto recursive cll.... C/C++/Jv 0.. Σ () (c) L = {() n n 0} = {ε,,,,...}
35 int q_0(chr in[]){ switch(in[0]){ cse : return q_(in+); cse b : return q_0(in+); cse \0 : return ; defult: return -; } } int q_(chr in[]){ switch(in[0]){ cse : return q_0(in+); cse b : return q_(in+); cse \0 : return 0; defult: return -; } } int M0(chr in[]){ return q_0(in); }.: M 0 C () Σ={} (b) Σ={, b} (c) Σ={, b, c}... Σ={, b} 0 () b bb, bb, bb (b) bb b bb, bb, bb (c) b b bb, bb, bb, (d) bb b bb, bbb, bbbb (e) 0 b 0 ε,, bbb, bbb, bbb (f) bb, bbbbbbbbbbb bbbb b
36 .. () R (b) T
37 q q. () q q, q,.... () nondeterministic q. (). ()
38 q q q q q q () () ().:. 0 0 / /
39 u v w H,F,R H,F q 0 H q F F q.: deterministic finite stte utomton DFA (nondeterministic finite stte utomton NFA... L J. L J = {uvw u {H, F, R},v {H, FF}, w {H, F} } 0 L J u v w DFA. uvw NFA. NFA u v w q 0 H F R q 0 u ( {H, F, R} ) q 0 q v ( {H, FF}) q H F q w ( {H, F} ) DFA q 0 H q 0 q q 0 F q 0 q DFA q H R DFA DFA q
40 NFA. HFRFHF q 0 H q 0 F q q 0 q q R q 0 F q 0 H q q 0 F q 0 q q q 0 q 0 H q 0 q q q F q q R HFRFHF. FFRFHRF q 0 F q 0 F q q 0 q R q 0 F q 0 H q q 0 q R q 0 F q 0 q q 0 FFRFHRF NFA / 0
41 . NFA M =(Q, Σ,δ,q 0,F) Q Σ q 0 F DFA Q Σ q 0 Q F Q δ DFA Q Σ Q δ ˆδ : Q Σ Q ˆδ(q, ε) = {q}, ˆδ(q, u) = p δ(q,) ˆδ(p, u) Σ u Σ u ˆδ(q 0,u) F q 0 u ˆδ(q 0,u)) u M M L(M) M L(M) ={u Σ ˆδ(q 0,u) F }. M J, M J, =({q 0,q,q }, {H, F, R},δ J,,q 0, {q }) δ J, (q 0, H) = {q 0,q }, δ J, (q 0, F) = {q 0,q }, δ J, (q 0, R) = {q 0 }, δ J, (q, H) = {q }, δ J, (q, F) = {q }, δ J, (q, R) =, δ J, (q, H) =, δ J, (q, F) = {q }, δ J, (q, R) =. M J, L(M J, )={u {H, F, R} ˆδ J, (q 0,u) {q } = }
42 HRHF M J, ˆδ J, (q 0, HRHF) ˆδ J, (q 0, HRHF) = ˆδ J, (p, RHF ) p δ J, (q 0,H) = ˆδ J, (q 0,RHF) ˆδ J, (q,rhf) = ˆδ J, (p, HF ) ˆδ J, (p, HF ) p δ J, (q 0,R) p δ J, (q,r) = ˆδ J, (q 0,HF) = ˆδ J, (p, F ) p δ J, (q 0,H) = ˆδ J, (q 0,F) ˆδ J, (q,f) = ˆδ J, (p, ε) ˆδ J, (p, ε) p δ J, (q 0,F) p δ J, (q,f) = (ˆδ J, (q 0,ε) ˆδ J, (q,ε)) ˆδ J, (q,ε) = ({q 0 } {q }) {q } = {q 0,q,q } ˆδ J, (q 0, HRHF) {q } = {q } HRHF L J = {uvw...} u v w. u {H, F, R} δ J, (q 0, H) q 0, δ J, (q 0, F) q 0, δ J, (q 0, R) q 0. v {H, FF} 0 δ J, (q 0, H) q, δ J, (q 0, F) q, δ J, (q, F) q w {H, F} δ J, (q, H) q, δ J, (q, F) q. NFA DFA DFA NFA DFA M J. M J =({q 0,q,q }, {H, F, R},δ J,q 0, {q })
43 δ J (q 0, H) = q, δ J (q 0, F) = q, δ J (q 0, R) = q 0, δ J (q, H) = q, δ J (q, F) = q, δ J (q, R) = q 0, δ J (q, H) = q, δ J (q, F) = q, δ J (q, R) = q 0. NFA M J M J =({q 0,q,q }, {H, F, R},δ J,q 0, {q }) δ J (q 0, H) = {q }, δ J (q 0, F) = {q }, δ J (q 0, R) = {q 0 }, δ J (q, H) = {q }, δ J (q, F) = {q }, δ J (q, R) = {q 0 }, δ J (q, H) = {q }, δ J (q, F) = {q }, δ J (q, R) = {q 0 }. DFA NFA. NFA DFA. NFA DFA NFA Σ={, b} 0 NFA DFA : L(ε) =L(M )=L(M )={ε} 0 NFA M. () M = ({q 0 }, Σ,δ,q 0, {q 0 }) δ (q 0,)=, δ (q 0,b)=. () NFA NFA : L( ) =L(M )=L(M )= NFA M. () M =({q 0 }, Σ,δ,q 0, ) δ (q 0,)=, δ (q 0,b)= 0 M. () DFA NFA q 0 q 0
44 q 0 q 0 q 0 q () () () q 0 q b q q q 0 () () q 0 q q 0 q b b () b q (),b q 0 q q ().: NFA : L() =L(M )=L(M )={} {} NFA M. () M =({q 0,q }, Σ,δ,q 0, {q }) δ (q 0,)={q }, δ (q,)=, δ (q 0,b)=, δ (q,b)=. M. () NFA NFA Σ {} NFA 0 NFA. ()
45 : L(b) =L(M )=L(M )={b} {b} NFA M. () M =({q 0,q,q,q }, Σ,δ,q 0, {q }) δ (q 0,)={q }, δ (q 0,b)=, δ (q,)=, δ (q,b)={q }, δ (q,)={q }, δ (q,b)=, δ (q,)=, δ (q,b)=. DFA M. () NFA : L( )=L(M )=L(M )={ n n 0} 0 NFA M. () M =({q 0 }, Σ,δ,q 0, {q 0 }) δ (q 0,)={q 0 }, δ (q 0,b)=. 0 M. () : L( b )=L(M )=L(M )={ n n 0} {b n n 0} NFA M. () M =({q 0,q,q }, Σ,δ,q 0, {q,q }) δ (q 0,)={q }, δ (q 0,b)={q }, δ (q,)={q }, δ (q,b)=, δ (q,)=, δ (q,b)={q }. NFA b M. () : L((b) )=L(M )=L(M )={(b) n n 0} 0 NFA M. () M =({q 0,q }, Σ,δ,q 0, {q 0 }) δ (q 0,)={q }, δ (q 0,b)=, δ (q,)=, δ (q,b)={q 0 }.
46 NFA DFA M. () q NFA DFA NFA DFA NFA : L(( b) ) =L(M )=L(M )={u u Σ } 0 NFA M. () M =({q 0,q,q }, Σ,δ,q 0, {q }) δ (q 0,)={q 0,q }, δ (q 0,b)={q 0 }, δ (q,)={q }, δ (q,b)=, δ (q,)=, δ (q,b)=. DFA M. () b q 0 NFA NFA δ (q 0,)={q 0,q } q 0 q q {uv u, v Σ } NFA b b bbbbb NFA. NFA DFA 0 NFA NFA DFA NFA DFA NFA. HFRFHF NFA
47 q 0 H q 0 F q q 0 q q R q 0 F q 0 H q q 0 F q 0 q q q NFA NFA DFA NFA DFA NFA q 0 H q 0 F q 0 R F q0 q 0 H q0 F q 0 q q q q q q q q 0 H NFA q 0 q 0 DFA q 0 q F NFA q 0 q 0 q q q DFA q 0 q q 0 q q q 0 q q DFA q 0 HFRFHF q 0 q q q 0 q q NFA q 0 q q q DFA q 0 q q NFA q q 0 q q DFA 0 DFA DFA NFA DFA NFA DFA NFA NFA DFA NFA n DFA n DFA NFA DFA n n
48 q q 0, 0, q 0 q q NFA: M 0 0, q 0 q 0 q 0 q 0 q q 0 0 q q 0, q q 0 0 q 0 q q 0, DFA: M 0 0, DFA: M 0.: NFA DFA M =(Q, Σ,δ,q 0,F) NFA M DFA: M =(Q, Σ,δ,q 0,F ) u u L(M) u L(M ) u / L(M) u/ L(M ) M M Q Q = Q Q M M δ : Q Σ Q M δ : Q Σ Q δ (P, ) = δ(p, ) p P q 0 = {q 0 } M P F Q P F Q Q M F 0. NFA: M 0 M 0 =({q 0,q,q }, {0, },δ,q 0, {q }) δ
49 δ(q 0, 0) = {q,q }, δ(q 0, ) =, δ(q, 0) =, δ(q, ) =, δ(q, 0) =, δ(q, ) = NFA DFA. M 0 M 0 = (Q 0, {0, },δ 0,q 0,F 0) Q 0 = {q 0,q,q } = {, {q 0 }, {q }, {q }, {q 0,q }, {q 0,q }, {q,q }, {q 0,q,q }} q 0 = {q 0 } F 0 = {{q }, {q 0,q }, {q,q }, {q 0,q,q }} δ 0(, 0) =, δ 0(, ) =, δ 0({q 0 }, 0) = {q,q }, δ 0({q 0 }, ) =, δ 0({q }, 0) =, δ 0({q }, ) =, δ 0({q }, 0) =, δ 0({q }, ) =, δ 0({q 0,q }, 0) = {q,q }, δ 0({q 0,q }, ) =, δ 0({q 0,q }, 0) = {q,q }, δ 0({q 0,q }, ) =, δ 0({q,q }, 0) =, δ 0({q,q }, ) =, δ 0({q 0,q,q }, 0) = {q,q }, δ 0({q 0,q,q }, ) =.. M 0 q 0 = {q 0 } {q 0 } {q,q } {q 0 } {q,q } M 0. M 0 M 0 = (Q 0, {0, },δ 0,q 0,F 0) Q 0 = {, {q 0 }, {q,q }} q 0 = {q 0 } F 0 = {{q,q }} δ 0(, 0) =, δ 0(, ) =, δ 0({q 0 }, 0) = {q,q }, δ 0({q 0 }, ) =, δ 0({q,q }, 0) =, δ 0({q,q }, ) =. Q 0, {q 0}, {q }, {q }, {q 0,q }, {q 0,q } [], [q 0 ], [q ], [q ], [q 0,q ], [q 0,q ] {} [ ]
50 R R q 0 () q 0 q H 0 q () q 0 H F q 0 q q 0 q () R q 0 H F R q 0 q F H R q 0 H F R q 0 q F H q 0 q q 0 q q H R F q 0 q H q 0 q q F R () () DFA M J,.: NFA. DFA DFA M 0 M 0 0 {q 0 } DFA δ δ (,)= DFA NFA NFA NFA DFA M J,. DFA DFA {q 0,q,q } DFA {q 0 } DFA. () H 0
51 {q 0,q }. () {q 0,q } NFA q DFA {q 0,q } F {q 0,q }. () {q 0,q } F {q 0,q,q }. (). () DFA. () M J, M J, =(Q J,, {H, F, R},δ J,,q 0,F J,) Q J, = {{q 0 }, {q 0,q }, {q 0,q }, {q 0,q,q }}, q 0 = {q 0 }, F J, = {{q 0,q }, {q 0,q,q }}. 0 δ J, ({q 0}, H) = {q 0,q }, δ J, ({q 0}, F) = {q 0,q }, δ J, ({q 0}, R) = {q 0 }, δ J, ({q 0,q }, H) = {q 0,q }, δ J, ({q 0,q }, F) = {q 0,q,q }, δ J, ({q 0,q }, R) = {q 0 }, δ J, ({q 0,q }, H) = {q 0,q }, δ J, ({q 0,q }, F) = {q 0,q,q }, δ J, ({q 0,q }, R) = {q 0 }, δ J, ({q 0,q,q }, H) = {q 0,q }, δ J, ({q 0,q,q }, F) = {q 0,q,q }, δ J, ({q 0,q,q }, R) = {q 0 }.. NFA DFA NFA M =(Q, Σ,δ,q 0,F) DFA M =( Q, Σ,δ,q 0,F ) u ˆδ(q 0,u)= ˆδ ({q 0 },u) u u P ˆδ(q, u) = ˆδ (P, u) q P
52 : u = ε u =0 q ˆδ. ˆδ(q, ε) = q = P q P q P ˆδ. ˆδ (P, ε) =P ˆδ(q, ε) = ˆδ (P, ε) : P n u ˆδ(q, u) = ˆδ (P,u) q P ˆδ. ˆδ(q, u) = ˆδ(q,u) q P q P q P q δ(q,) ˆδ. δ ˆδ (P, u) = ˆδ (δ (P, ),u) = ˆδ(q, u) = q δ (P,) q P q δ (q,) ˆδ(q, u) ˆδ(q, u) = ˆδ (P, u) q P. C NFA NFA DFA 0 lex
53 .. Σ () (c) L = {() n n 0} = {ε,,,,...} NFA () Σ={} (b) Σ={, b} (c) Σ={, b, c}... Σ={, b} NFA NFA NFA DFA 0 () b bb, bb, bb (b) b b bb, bb, bbb, bbb, bbbb (c) bb b bb, bbb, bbbb
54 ε-. ε- 0 ε- ε-trnsition ε ε ε- nondeterministic finite stte utomton with ε-trnsition ε- ε- ε-nfa. ε-nfa q 0 q q q HFRFHF q 0 H q0 ε ε q F q 0 q ε R q0 q ε F q 0 q ε H q0 q ε F q 0 q ε q q q ε q q q q q ε q q ε ε- q 0 H ε- q H q 0 q ε- q 0 q q q ε HFRFHF 0
55 ε- u H,F,R v w H,F q 0 q H q q F F q.: q 0 H q0 F q0 R q0 F q0 ε q H q ε q F q HFRFHF NFA NFA. L J = {uvw...} u v w ε-nfa. ε-. ε-nfa u v w {q 0 } {q,q,q } {q } ε- q 0 q u v q q v w 0. ε-nfa M =(Q, Σ,δ,q 0,F) Q Σ q 0 F NFA Q Σ q 0 ( Q F ( Q δ NFA ε ( Q (Σ {ε}) Q q q ε- ε-closure(q) ( Q) ε-closure(q) ={q} {q Q ε-closure(q) q, δ(q,ε) q } ε-closure(q) q q ε-closure(q) q ε- q q
56 ε- δ ˆδ : Q Σ Q ˆδ(q, ε) = ε-closure(q), ˆδ(q, u) = q ε-closure(q) q δ(q,) ˆδ(q,u) Σ u Σ u ˆδ(q 0,u) F q 0 u ( ˆδ(q 0,u) u M M L(M) M L(M) ={u Σ ˆδ(q 0,u) F } M J, M J, =({q 0,q,q,q,q }, {H, F, R},δ J,,q 0, {q }) δ J, (q 0, H) = {q 0 }, δ J, (q 0, F) = {q 0 }, δ J, (q 0, R) = {q 0 }, δ J, (q 0,ε)={q }, δ J, (q, H) = {q }, δ J, (q, F) = {q }, δ J, (q, R) =, δ J, (q,ε)=, δ J, (q, H) =, δ J, (q, F) =, δ J, (q, R) =, δ J, (q,ε)={q }, δ J, (q, H) =, δ J, (q, F) = {q }, δ J, (q, R) =, δ J, (q,ε)=, δ J, (q, H) = {q }, δ J, (q, F) = {q }, δ J, (q, R) =, δ J, (q,ε)=, M J, L(M J, )={u {H, F, R} ˆδ J, (q 0,u) {q } = } ε-nfa. ε-nfa NFA NFA DFA. ε-nfa NFA
57 ε- M =(Q, Σ,δ,q 0,F) ε-nfa M ε- NFA: M =(Q, Σ,δ,q 0,F ) u u L(M) u L(M ) u / L(M) u/ L(M ) M M Q = Q q 0 = q 0. M δ : Q (Σ {ε}) Q M δ : Q Σ Q δ (q, ) = ˆδ(q, ) = ε-closure(q ) q ε-closure(q) q δ(q,) M q M q ε- ε- F F = F {q Q ε-closure(q) F } ε- q Σ={, b} 0. () ε-nfa M q 0 q ε- q 0 M q 0 q q {ε} M ({q 0,q }, Σ,δ, {q }) δ (q 0,)=, δ (q 0,b)=, δ (q 0,ε)={q }, δ (q,)=, δ (q,b)=, δ (q,ε)=. { F F {q0 }, if ε-closure(q = 0 ) F F, otherwise
58 ε- q 0 q q 0 q M () M q 0 q q 0 q q q M () M q 0 q q 0 q b q b q q b q M () M q 0 q b q,b,b q 0 q,b,b b q b M () M.: ε-nfa NFA
59 ε- M ({q 0,q }, Σ,δ,F ) δ F δ δ (q 0,)=, δ (q,)=, δ (q 0,b)=, δ (q,b)=. F {q 0,q } F = F {q Q ε-closure(q) F } = {q } {q Q ε-closure(q) {q } } ε-closure(q 0 )={q } F q 0. () ε-nfa M q 0 q ε q () NFA M q 0 q M q ε- q M q {}. () () M b 0 b b q0 q q q 0 q q M b q 0 q ε q b q ε- / M. () () () M q 0 ε q q0 q ε q b q ε- M M q0 q 0. M M
60 ε- H,F,R H H H,F q 0 H,F,R q H q H,F q F F H F F q.: ε-nfa. NFA :.. ε- NFA. q 0 H q q q. DFA ε-nfa M =(Q, Σ,δ,q 0,F) NFA M =( Q, Σ,δ,q 0,F ). ε-closure(q 0 ) F q 0 F. u u ˆδ(q 0,u)= ˆδ (q 0,u) 0.. u u u ˆδ(q 0,u)= ˆδ (q 0,u) 0
61 ε- M 0 : q 0 q q b? M : q 0 q b q? M : q 0 q q b? M : q 0 q q c b? c M : q 0 b, q q? M : q 0 c b, q, q?.: ε-nfa NFA. C ε-nfa ε-nfa NFA NFA DFA... ε-nfa M 0,...,M M 0 M
62 ε-.. ε-nfa NFA.. NFA DFA M 0... M Σ={, b} M... Σ={, b, c}
63 . DFA. ε-nfa ε-nfa r Σ L(r) ε-nfa: 0 M =(Q, Σ,δ,q 0,F) u u L(r) u L(M) u / L(r) u/ L(M) M M r r = ( Σ) r = ε r = r r ε-nfa: M M r = r r r = r r r = r r =(r ) r = r r = ( Σ) ε-nfa.() ε-nfa M M =({q 0,q f }, Σ,δ,q 0, {q f }) δ (q 0,)={q f } δ. r = ε ε-nfa.() ε-nfa M ε M ε =({q 0,q f }, Σ,δ ε,q 0, {q f }) δ ε (q 0,ε)={q f } δ ε
64 r= r= r= q 0 q f q 0 q f q 0 q f () () () r=r r q 0 q 0 q f q 0 q f q f () r=r r q 0 q f q 0 q f () r=r * q 0 q 0 q f q f ().: ε-nfa
65 . r = ε-nfa.() ε-nfa M M =({q 0,q f }, Σ,δ,q 0, {q f }) δ r r ε-nfa: M M M =(Q, Σ,δ,q0, {qf }) M =(Q, Σ,δ,q0, {qf }). r = r r ε-nfa.() ε-nfa M A M A =(Q Q {q 0,q f }, Σ,δ A,q 0, {q f }) δ A (q 0,ε)={q 0,q 0} δ A (qf,ε)={q f } δ A (qf,ε)={q f } Σ δ A (q 0,)=δ A (qf,)= δa(qf,)= M q Q Σ {ε} 0 δ A (q, ) =δ (q, ) M q Q Σ {ε} δ A (q, ) =δ (q, ). r = r r ε-nfa.() ε-nfa M C M C =(Q Q, Σ,δ C,q0, {qf }) δ C(qf,ε)={q 0} q Q {qf } Σ {ε} δ C(q, ) =δ (q, ) q Q Σ {ε} δ C (q, ) =δ (q, ). r = r ε-nfa.() ε-nfa MK MK =(Q {q0,qf }, Σ,δK,q0, {qf }) δk(q0,ε)={q0,q f } δ K (qf,ε)={q 0,q f } q Q {qf } Σ {ε} δk(q, ) =δ(q, ) 0. r =(r ) ε-nfa M. r = r + r = r r r = r r (H F R) ε-nfa H F R ε-nfa. () () () (q 0 q f H F ε-nfa.() () ε-nfa.().() H F R (H F) R ε-nfa.() () ε-nfa.().() (H F R) ε-nfa.() ε-nfa.().() A Alterntion C Conctention K Kleene :
66 r=h r=f r=r H () F () R () r=h F H F () r=(h F) R=H F R H F R () r=(h F R) * H F R ().: (H F R) ε-nfa
67 H F R H F F H F.: (H F R) (H FF)(H F) ε-nfa 0 (H F R) (H FF)(H F) ε-nfa. (H F R) (H FF)(H F) ε-nfa... ε-
68 . ε- ε DFA NFA ε-nfa. DFA NFA ε- ε-nfa ε-nfa ε-nfa NFA NFA DFA DFA DFA ε-nfa NFA DFA DFA DFA DFA DFA DFA Σ ={}. () ε-nfa NFA. () DFA. () DFA. C n (n ) ε-
69 q 0 q q q q q () -NFA q 0 q q q q q () NFA q 0 q q q q q q q () DFA.: ε-nfa NFA DFA 0 lex DFA. () DFA DFA DFA DFA C
70 C 0 0. DFA M =(Q, Σ,δ,q 0,F) p, q ( Q) p q equivlent p q u ( Σ ) δ(p, u) δ(q, u) / p q p / q p q u ( Σ ) δ(p, u) δ(q, u). p F q/ F p/ F q F p / q.. ( Σ) δ(p, ) / δ(q, ) p / q. p q p q p q p q 0
71 q 0 q q q 0 [q, q ] () ().: DFA 0 q 0 q q q q q q q.: DFA p q [p, q] p q p q [p, q] p q [p, q] p q.. () DFA. () DFA DFA. q 0 /q, q 0 /q q q. δ(q,)(=q ) δ(q,)(=q ) δ(q,) / δ(q,) q /q q q q q [q,q ].() DFA. (). () 0. DFA C (=!/!! = ).
72 .: q q q q q q q q 0 q q q q q q.: q q q q q q q q 0 q q q q q q... DFA q q q i i q /q i... δ(q, ) =p δ(q,)=p p / p q / q q / q δ(q, ) =p / p = δ(q,). q 0 /q δ(q 0, ) = q /q = δ(q, ) q 0 /q δ(q 0, 0) = q 0 /q = δ(q, 0) q 0 /q δ(q 0, 0) = q /q = δ(q, 0) q 0 /q δ(q 0, ) = q /q = δ(q, ) q /q δ(q, 0) = q /q = δ(q, 0) δ(q, ) = q /q = δ(q, )
73 .: q q q q q q q q 0 q q q q q q q /q δ(q, ) = q /q = δ(q, ) q /q δ(q, ) = q /q = δ(q, ) q /q δ(q, ) = q /q = δ(q, ) q /q δ(q, 0) = q /q = δ(q, 0) q /q δ(q, 0) = q /q = δ(q, 0) q /q δ(q, 0) = q /q = δ(q, 0) δ(q, ) = q /q = δ(q, ) q /q δ(q, 0) = q /q = δ(q, 0) q /q δ(q, ) = q /q = δ(q, ) q /q δ(q, 0) = q /q = δ(q, 0) q /q δ(q, 0) = q /q = δ(q, 0) δ(q, ) = q /q = δ(q, ) q /q δ(q, ) = q /q = δ(q, )... q 0 /q δ(q 0, 0) = q /q = δ(q, 0) δ(q 0, ) = q /q = δ(q, ) q /q δ(q, 0) = q /q = δ(q, 0) δ(q, ) = q /q = δ(q, ).... q 0 q q q q q
74 .: q q q q q q q q 0 q q q q q q 0 0 [q, q ] q [q 0, q ] 0 q 0 0 [q, q ].: DFA.. q 0 q q q q q p q [p, q] 0.. () DFA NFA DFA.... DFA q q q i i q /q i... {q 0 } / {q 0,q } δ({q 0 },F)={q 0,q } / {q 0,q,q } = δ({q 0,q },F)...
75 R R q 0 q H 0 q H F F H R H F q 0 q q 0 q q R F DFA M J,.: DFA.: {q 0,q } {q 0,q } {q 0,q,q} {q 0 } {q 0,q } {q 0,q }. {q 0,q } {q 0,q,q }. DFA. DFA DFA... DFA M J, DFA. DFA
76 .: {q 0,q } {q 0,q } {q 0,q,q} {q 0 } {q 0,q } {q 0,q }.: {q 0,q } {q 0,q } {q 0,q,q} {q 0 } {q 0,q } {q 0,q } R q 0 R H q 0 q q 0 q q F R H,F q 0 q H,F.: DFA
77 0 lex UNIX lex lex , 0,, 00, 0,, +0, 0,, + 0 ( ( )(0 ) )@
78 0 lex // %% { return ; }. { return 0; } %% // int min(){ if(yylex()) printf("yes, %s is ccepted\n",yytext); else printf("no, rejected\n"); } int yywrp(){ return ; } lex lex lex 0. lex lex C lex 0. lex %%. 0.. ction
79 0 lex 0 { return [-][0-]*)@ exception { return 0; } 0. lex C int yylex() yylex() C.. C min yylex() C 0 YES,... is ccepted... yylex() yytext C 0 NO, rejected 0 printf() C lex C++ C++ cout C printf(). int ( )(0 ) )@ lex C++ lex++ flex++ lex -+ C++
80 0 lex * : 0 r r ASCII lex r* 0 [ ] - : () lex [] lex [ ] - lex [0-] (0 ) 0 [-b] ASCII b lex lex exmple.l UNIX > lex exmple.l > flex exmple.l 0 lex.yy.c C > cc lex.yy.c > gcc lex.yy.c.out >./.out 0
81 0 lex YES, NO, rejected 0 +,, +, + lex "-"))*@ + lex + "
82 0 lex { return ; }. { return 0; } %% int min(){ if(yylex()) printf("yes, %s is ccepted\n",yytext); else printf("no, rejected\n"); } int yywrp(){ return ; } lex 0. F R) (H FF)(H FF)[HF]*@ [] [HFR] [HF] H F R H F F R)*(H FF)(H F)*@ 0 lex
83 0 lex { return ; }. { return 0; } %% int min(){ if(yylex()) printf("yes, %s is ccepted\n",yytext); else printf("no, rejected\n"); } int yywrp(){ return ; } lex
84 0. Moore mchine {0, } DFA. DFA. 0.. q 0 0 q
85 0 0 q 0 q 0.: q 0 q q 0.: q 0 0 q 0 q 0 0 q 0 q 0 q bit v v v mod. 00 q 0 q 0 0 q 0 q q 0 0 q 0 0 ε v p p =0,, v p mod v + p + mod
86 0/ q 0 /0 q 0/ /0.: (Q, Σ,,δ,λ,q 0 ) Q Σ δ : Q Σ Q q 0 Q DFA λ : Q 0. Mely mchine 0. DFA... b /b q 0 0 q 0 q 0 q 0 q q H
87 0/0 / 0/ q 0 q q /0 0/ /.:
88 { n b n n 0} = {ε, b, bb, bbb,...} DFA.. Chomsky { n b n n 0} b ) : {( n ) n n 0} = {, (), (()), ((())), (((()))),...} 0 C/C++ +b, +b+c, *b+c, -b*c C C++ Jv. Σ Σ Σ
89 0 terminl symbol terminl nonterminl symbol nonterminl Σ T T T N (T N) u T u α (T N) α T N T (T N) production rule production syntx rule X β X N β (T N) β ε X ε αxγ X N, α,γ (T N) X β αxγ X β αβγ αxγ αβγ αxγ αβγ P α α... α k k α α, α α,, α k α k α α α k vrible
90 derivtion sequence α α k 0 α α k α α k context-free grmmr G (N,T,P,S) N T P S S ( N S (T N) sententil form S T sentence G context-free lnguge L(G) G L(G) ={u T S u} G L(G) { n b n n 0} G = ({S}, {, b},p,s) P = {S ε, S Sb} S ε S Sb b S Sb Sbb bb S Sb Sbb Sbbb bbb... L(G )={u T S u} = { n b n n 0} L(G ) {ε} G = ({S}, {, b},p,s) P = {S b, S Sb} 0 0
91 b G = ({S, A, B}, {, b},p,s) P = {S B, S ba, A, A S, A baa, B b, B bs, B BB} G b : A b B b :. G E E E + / id ( ) E E + E E + E E E + id E E + id id id + id id 0 id + id id id. :
92 : E E + E : E E E : E E E : E E/E : E id : E ( E ).: : G E + E E E leftmost derivtion E + E E E E + E id + E id + E E id + id E id + id id rightmost derivtion E E + E E + E E E + E id E + id id id + id id
93 . A A B...B k A B...B k A B... B k B...B k B i i k B i C...C j B...B i C...C j B i+...b k A B... B i B i B i+... B k C... C j 0 0 S t t...t n S t t...t n syntx tree root S lef t t... t n G t t...t k mbiguous unmbiguous. id + id id.
94 E E E E E E E E E E id + id id id + id id () (b).: id + id id E E E E E E E E E E id + id + id id + id + id () (b).: id + id + id id + id + id.. G opertor precedence id + id id id + (id id). (b) left ssocitive id + id + id (id + id) + id. ().. T term F fctor E T F E + T / F id ( )
95 : E E + T : E E T : E T : T T F : T T/F : T F : F id : F ( E ).: : G E E T E E T F E T T F T T F F F F id + id + id id + id id () id + id + id (b) id + id id.: : id, () >, / > +, id + id id id + id + id.... (). / : E T + E : E T E : E T : T F T : T F/T : T F
96 pushdown utomton stck PDA 0. { n b n n } PDA n 0 PDA. PDA. pop push..... q 0 q q q 0 q b q 0. # initil stck symbol #. q 0 FILO first in, lst out LIFO lst in, first out
97 q 0 # A A A bb... (,# #A) (,A AA) (b,a ) (b,a ) q 0 q (,# #) q.: n b n 0 () A (b) b A A q (c). q () b A A (b) # q ε (c). q A b A b # DFA NFA ε-nfa
98 p Z q Z Z Z... Z k k 0 p q (, Z Z Z...Z k ) ε (ε, Z Z Z...Z k ) (, Z ε).. bbbb q γ u q γ u 0 instntneous description PDA bbbb q 0 # bbbb.() q 0 #A bbbb q 0 #AA bbbb q 0 #AAA bbbb q 0 #AAAA bbbb b.(b) q A
99 q 0 #A bbbb q 0 #AA bbbb q 0 #AAA bbbb q 0 #AAAA bbbb q #AAA bbb q #AA q #A q # q #.:. q #AAA bbb.() q #AA q #A q #.(b) q # q bbbb. ε bb bbb 0 { n b n n 0} PDA n =0
100 PDA : E E + F : F id : E F : F ( E ). PDA q PDA. Z. Z ε 0 PDA DFA NFA NFA DFA PDA PDA PDA PDA {0,, c} {ucu R u {0, } + } u R u 0c0, c, 0c0, 0c0, 00c00, 0c0 S 0c0, S c, S 0S0, S S 0 PDA. PDA. PDA u c u R. 0c0 q {0, } {uu R u {0, } + } c S 00, S, S 0S0, S S u 00
101 (0,# #A) (0,A AA) (0,B BA) (,# #B) (,A AB) (,B BB) (0,A ε) (,B ε) q 0 q (c,a A) (c,b B) (ε,# #) q.: {ucu R u {0, } + } 0 0 uu R ucu R ucu R c uu R PDA. q 0 0 A B. 00 q. uu R uu R u q 0 q. 0
102 q 0 # 0c0 q 0 #A c0 q 0 #AB c0 q 0 #ABB c0 q #ABB 0 q #AB 0 q #A 0 q # q #.:.. PDA PDA 0.. PDA M (Q, Σ, Γ,δ,q 0,Z 0,F) Q Σ q 0 F Q Σ q 0 ( Q) F ( Q) Γ stck lphbet stck symbol 0
103 (0,# #A) (0,A AA) (0,B BA) (,# #B) (,A AB) (,B BB) (0,A ε) (,B ε) q 0 q (0,A ε) (,B ε) (ε,# #) q.: {uu R u {0, } + } Z 0 ( Γ) stck strt symbol stck bottom symbol δ Q Γ (Σ {ε} Q Γ PDA (q, γ, u) ( Q Γ Σ ) s s...s k s s k Z 0 (q, Z 0 γ,u) Q {Z 0 }Γ Σ PDA M =(Q, Σ, Γ,δ,q 0,Z 0,F) (q 0,Z 0,u) u M (q, γz, w) (q Q, γ Γ,Z Γ, Σ, w Σ ) δ(q, Z, ) (p, γ ) M (q, γz, w) (p, γγ,w) (q, γz, w) M (p, γγ,w) 0 M q Z M p Z γ Σ ε ε ε- 0
104 q 0 # 00 q 0 #A 0 q 0 #AB 0 q 0 #ABB 0 q #AB 0 q #A 0 q # q #.:. D,D,,D k (k ) : D M D,D M D,, D k M D k D M D k M M PDA M L(M) L(M) ={u Σ (q 0,Z 0,u) M (p, γ, ε), p F, γ Γ } M u u M. M =({q,q,q }, {, b}, {#,A},δ,q 0, #, {q }) 0
105 q 0 # 00 q 0 #A 0 q 0 #AB 0 q 0 #ABB 0 q 0 #ABBB 0 q 0 #ABBBB 0 q 0 #ABBBBA.:. δ (q 0, #,)={(q 0, #A)}, δ (q 0, #,b)=, δ (q 0, #,ε)=, δ (q 0, A, ) ={(q 0, AA)}, δ (q 0, A, b) ={(q,ε)}, δ (q 0, A, ε) =, δ (q, #,)=, δ (q, #,b)=, δ (q, #,ε)={(q, #)}, δ (q, A, ) =, δ (q, A, b) ={(q,ε)}, δ (q, A, ε) =, δ (q, #,)=, δ (q, #,b)=, δ (q, #,ε)=, δ (q, A, ) =, δ (q, A, b) =, δ (q, A, ε) =. bbbb... PDA 0
106 (q 0, #,bbbb) M (q 0, #A, bbbb) M M M M M (q 0, #AA, bbbb) (q 0, #AAA, bbbb) (q 0, #AAAA, bbbb) (q, #AAA, bbb) (q, #AA, bb) M (q, #A, b) M M (q, #,ε) (q, #,ε).: PDA M 0
107 0 phrse structure grmmr context-sensitive grmmr regulr grmmr α β α (T N) N(T N),β (T N) α β Turing mchine 0 liner bounded utomton. 0
108 Σ={, b, c} { i b j c k i, j, k 0} b c A A, A B, B bb, B C, C cc, C ε. A { m c n m, n 0} {b m c n m, n 0} c b c S ε, S A, S bb, A C, A A, B C, C ε, B bb, C cc. X X N, T {ε}. X Y X, Y N, T {ε} 0 right regulr grmmr X Y X Y left regulr grmmr X X Y u right liner grmmr u left liner grmmr 0
109 .. α β α, β (T N) α β α β Σ ={, b, c} { n b n n } { n b n c n n } S bc, S SBc, cb Bc, bb bb S SBc SBcBc bcbcbc bbbccc 0 0 n n b n c n { n b n c n n } monotonic grmmr / 0
110 . α β 0
111 0. tpe tpe hed finite control prt. cell /. 0 () n... n n blnk symbol B Church s Thesis
112 i n B B B.: (b) (c) q 0. q q () q q (b) (c) δ(q, ) =(q,,l) δ(q, ) =(q,,r) 0 L R. () δ(q, ) (b) q δ
113 . Σ={, b} { m b n m>n} u u b. x 0. b b B b b b x.. 0 q 0 q q q q f q 0 q f q f δ(q f,...) δ(q 0,)=(q,x,R), δ(q 0,b)=, δ(q 0,x)=, δ(q 0,B)= δ(q,)=(q,,r), δ(q,b)=(q,x,l), δ(q,x)=(q,x,r), δ(q,b)=(q f,b,l) δ(q,)=(q,,l), δ(q,b)=, δ(q,x)=(q,x,l), δ(q,b)= δ(q,)=(q,,l), δ(q,b)=, δ(q,x)=(q 0,x,R), δ(q,b)= bb. m>n m b n m DFA PDA
114 q 0 b b B B B q x b b B B B q x x x b B B B q x b b B B B q x x x x B B B q x b b B B B q x x x x B B B q q q q 0 q q x x x x x x x b x b x b x b x x b x x b B B B B B B B B B B B B B B B B B B q q 0 q q q q f x x x x x x x x x x x x x x x x x x x x x x x x x x x x B B B B B B B B B B B B B B B B B B.: bb... n n
115 & B B B B B.: += 0 m n m & n m + n. +=. { m b n m>n} m n m n m/n m n 0.. specil-purpose computer universl Turing mchine TM TM... TM i S
116 S B B P[TM i ] B S B B TM i TM U TM i (S) TM U (P[TM i ],S).: S TM i TM i (S). () TM U TM i P[TM i ] TM i S P[TM i ] δ(q 0,)=(q,x,R), δ(q,)=(q,,r), δ(q,)=(q,,l), x R R L... 0,,,,,x,R,L Σ. (b) P[TM i ] S B TM U TM U (P[TM i ],S) TM U S P[TM i ] S S... TM i (S) TM U (P[TM i ],S) TM i (S) TM U (P[TM i ],S) TM i (S) TM i S TM i (S)
117 0 TM U P[TM i ] S TM U (P[TM i ],S) stored progrm method ENIAC ON/OFF : Wikipedi ENIAC EDVAC λ 0...
118 computbility 0 0 Church-Turing thesis Church s thesis Turing complete PC C/C++/Jv/Ruby C++ C++ Web HTML HyperText Mrkup Lnguge SQL Structured Query Lnguge.. / Turing computble
119 ... / semi-lgorithm. x + bx + c b c 0 YES NO b b YES/NO /0 / decision problem decidble undecidble 0 n n N. 0 YES NO 0 semi-decidble n N n N n N n N N N N... n
120 Turing Mchine Hlting Problem 0.. S TM TM(S) S TM TM(S) H H(P[TM],S) P[TM] TM.. H(P[TM],S). TM(S)... H(P[TM],S) YES. TM(S)... H(P[TM],S) NO 0 H S S P[TM] H H(P[TM], P[TM]) H M H H M. H(P[TM], P[TM]) YES... M(P[TM]), H M H(P[TM], P[TM]) M H YES M 0
121 . H(P[TM], P[TM]) NO... M(P[TM]) M M P[M] M(P[M]) M(P[M]) M. M(P[M])... H(P[M], P[M]) NO. M(P[M])... H(P[M], P[M]) YES H 0. H(P[M], P[M]) NO... M(P[M]) H(P[TM],S) NO... TM(S). H(P[M], P[M]) YES... M(P[M]) H(P[TM],S) YES... TM(S). M(P[M])... M(P[M]). M(P[M])... M(P[M]) 0 S TM TM(S) H M(P[M]) M M C/C++ for (int i = 0; ; i++) return brek H NO M
122
NOTE P, A,. A P ( A, P ),,.,. P A. (set) (set), (). (element), (element).,.,. ( A, B, X, Y, P ), { } (),..3 (union) A, B,A B, A B (union),. A B = {x x
2. (set)............... 2.2,.... 2.3 (union)............ 2.4 (intersection)......... 2.5 (power set)......... 3.6 (cartesian product set)... 3 2, 3 2. (length)........ 3 2.2 (epsilon)............ 3 2.3
More informationuntitled
2010824 1 2 1031 5251020 101 3 0.04 % 2010.8.18 0.05 % 1 0.06 % 5 0.12 % 3 0.14 % 2010.8.16 5 0.42 % 2010.7.15 25 5 0.42 % 0.426% 2010.6.29 5 0.496 % 2010.8.12 4 0.85 % 2010.8.6 10 0.900 % 2010.8.18 2.340
More information2
2 6 7 9 4 6 7 2 3 4 5 6 7 8-0 - G G G G G G f f 9 e f - e f 0 5 e fe e c c cc B FD F 5 2 5 D F C e e e b 3 f f 5 ff ff f f f f b b bb b b b c c c ee ee e ee ee e f f 4 e e 7 5 5 e bb 6 7 f GE 8 f 9 5 F
More information() / (front end) (back end) (phase) (pass) 1 2
1 () () lex http://www.cs.info.mie-u.ac.jp/~toshi/lectures/compiler/ 2018 4 1 () / (front end) (back end) (phase) (pass) 1 2 () () var left, right; fun int main() { left = 0; right = 10; return ((left
More information1 n =3, 2 n 3 x n + y n = z n x, y, z 3 a, b b = aq q a b a b b a b a a b a, b a 0 b 0 a, b 2
n =3, 200 2 10 1 1 n =3, 2 n 3 x n + y n = z n x, y, z 3 a, b b = aq q a b a b b a b a a b a, b a 0 b 0 a, b 2 a, b (a, b) =1a b 1 x 2 + y 2 = z 2, (x, y) =1, x 0 (mod 2) (1.1) x =2ab, y = a 2 b 2, z =
More information( ) ( ) lex LL(1) LL(1)
() () lex LL(1) LL(1) http://www.cs.info.mie-u.ac.jp/~toshi/lectures/compiler/ 29 5 14 1 1 () / (front end) (back end) (phase) (pass) 1 2 1 () () var left, right; fun int main() { left = 0; right = 10;
More information@@ ;; QQ a @@@@ ;;;; QQQQ @@@@ ;;;; QQQQ a a @@@ ;;; QQQ @@@ ;;; QQQ a a a ; ; ; @ @ @ ; ; ; Q Q Q ;; ;; @@ @@ ;; ;; QQ QQ ;; @@ ;; QQ a a a a @@@ ;;; QQQ @@@ ;;; QQQ ;;; ;;; @@@ @@@ ;;; ;;; QQQ QQQ
More information31 33
17 3 31 33 36 38 42 45 47 50 52 54 57 60 74 80 82 88 89 92 98 101 104 106 94 1 252 37 1 2 2 1 252 38 1 15 3 16 6 24 17 2 10 252 29 15 21 20 15 4 15 467,555 14 11 25 15 1 6 15 5 ( ) 41 2 634 640 1 5 252
More information5 z x c. 0 2 4 6 8 9 6 7 8
5 z x c. 0 2 4 6 8 9 6 7 8 F F 2 FF G B 7 20 7 E D b c 2 3 6 7 D Y E F B C D E F B C D E F B D 5 04 7 g k k 0k900 0k20kk5 50k50 20k50kk45 455k725 900507252775 277505293 5 00k9040005 g R R 5 38,80048,50038,80048,500
More information取扱説明書 -詳細版- 液晶プロジェクター CP-AW3019WNJ
B A C D E F K I M L J H G N O Q P Y CB/PB CR/PR COMPONENT VIDEO OUT RS-232C LAN RS-232C LAN LAN BE EF 03 06 00 2A D3 01 00 00 60 00 00 BE EF 03 06 00 BA D2 01 00 00 60 01 00 BE EF 03 06 00 19 D3 02 00
More information基本操作ガイド
1 P.1-1 2 P.2-1 3 P.3-1 4 P.4-1 5 P.5-1 6 P.6-1 7 P.7-1 8 P.8-1 9 P.9-1 10 P.10-1 11 P.11-1 AAAAA BBBBB CCCCC A A AA BBBB CCCC A A A AAA CCC MMM SSS # # # BBB 1 2 3 1 2 3 (1) (2) (3) - - (3) (1)
More informatione 7 d d - - a 7 a - 6 Inormation b a
9/ 2008. No32 5 E 6 e 7 d d - - a 7 a - 6 Inormation b a e c c c a - dd d e b 6 e 6 6 Inormation e 7 7 a a b A e c c d 6 e a a a a a-aa a- a dddd d e b d d d 7 c c c d a d e e e e b 6 d c c c c c b 6
More informationuntitled
II yacc 005 : 1, 1 1 1 %{ int lineno=0; 3 int wordno=0; 4 int charno=0; 5 6 %} 7 8 %% 9 [ \t]+ { charno+=strlen(yytext); } 10 "\n" { lineno++; charno++; } 11 [^ \t\n]+ { wordno++; charno+=strlen(yytext);}
More informationB
B YES NO 5 7 6 1 4 3 2 BB BB BB AA AA BB 510J B B A 510J B A A A A A A 510J B A 510J B A A A A A 510J M = σ Z Z = M σ AAA π T T = a ZP ZP = a AAA π B M + M 2 +T 2 M T Me = = 1 + 1 + 2 2 M σ Te = M 2 +T
More information......1201-P1.`5
2009. No356 2/ 5 6 a b b 7 d d 6 ca b dd a c b b d d c c a c b - a b G A bb - c a - d b c b c c d b F F G & 7 B C C E D B C F C B E B a ca b b c c d d c c d b c c d b c c d b d d d d - d d d b b c c b
More information-34-
-33- -34- ! -35- ! -36- ! -37- -38- -39- -40- -41- -42- -43- -44- -45- -46- -47- -48- -49- -50- ! -51- -52- !! -53- -54- ! -55- -56- -57- !!!!! "" "!!! " "" " -58- -59- !!! -60- -61- -62- -63- ! -64- !
More informationHITACHI 液晶プロジェクター CP-AX3505J/CP-AW3005J 取扱説明書 -詳細版- 【技術情報編】
B A C E D 1 3 5 7 9 11 13 15 17 19 2 4 6 8 10 12 14 16 18 H G I F J M N L K Y CB/PB CR/PR COMPONENT VIDEO OUT RS-232C LAN RS-232C LAN LAN BE EF 03 06 00 2A D3 01 00 00 60 00 00 BE EF 03 06 00 BA D2 01
More information0 (18) /12/13 (19) n Z (n Z ) 5 30 (5 30 ) (mod 5) (20) ( ) (12, 8) = 4
0 http://homepage3.nifty.com/yakuikei (18) 1 99 3 2014/12/13 (19) 1 100 3 n Z (n Z ) 5 30 (5 30 ) 37 22 (mod 5) (20) 201 300 3 (37 22 5 ) (12, 8) = 4 (21) 16! 2 (12 8 4) (22) (3 n )! 3 (23) 100! 0 1 (1)
More informationオートマトンと言語理論 テキスト 成蹊大学理工学部情報科学科 山本真基 ii iii 1 1 1.1.................................. 1 1.2................................ 5 1.3............................. 5 2 7 2.1..................................
More informationII
II 16 16.0 2 1 15 x α 16 x n 1 17 (x α) 2 16.1 16.1.1 2 x P (x) P (x) = 3x 3 4x + 4 369 Q(x) = x 4 ax + b ( ) 1 P (x) x Q(x) x P (x) x P (x) x = a P (a) P (x) = x 3 7x + 4 P (2) = 2 3 7 2 + 4 = 8 14 +
More information高校生の就職への数学II
II O Tped b L A TEX ε . II. 3. 4. 5. http://www.ocn.ne.jp/ oboetene/plan/ 7 9 i .......................................................................................... 3..3...............................
More information日本糖尿病学会誌第58巻第1号
α β β β β β β α α β α β α l l α l μ l β l α β β Wfs1 β β l l l l μ l l μ μ l μ l Δ l μ μ l μ l l ll l l l l l l l l μ l l l l μ μ l l l l μ l l l l l l l l l l μ l l l μ l μ l l l l l l l l l μ l l l l
More information" " " " "!!
""!!!!! "! "! " " " " " " " "!! !!!!!!!!! ! !!!!! "β!"β"! " " "!! "! "!!! "!! !!! "! "!!!! "! !!!!! !!! " "!! "!!! " " "!!! ! "!! !!!!!!! " " " " "!! α!!!!! ! "! " " !!!!!!! "! ! ""!!!! !!!!!! " "! "!
More informationHITACHI 液晶プロジェクター CP-EX301NJ/CP-EW301NJ 取扱説明書 -詳細版- 【技術情報編】 日本語
A B C D E F G H I 1 3 5 7 9 11 13 15 17 19 2 4 6 8 10 12 14 16 18 K L J Y CB/PB CR/PR COMPONENT VIDEO OUT RS-232C RS-232C RS-232C Cable (cross) LAN cable (CAT-5 or greater) LAN LAN LAN LAN RS-232C BE
More informationボールねじ
A A 506J A15-6 A15-8 A15-8 A15-11 A15-11 A15-14 A15-19 A15-20 A15-24 A15-24 A15-26 A15-27 A15-28 A15-30 A15-32 A15-35 A15-35 A15-38 A15-38 A15-39 A15-40 A15-43 A15-43 A15-47 A15-47 A15-47 A15-47 A15-49
More information0226_ぱどMD表1-ol前
No. MEDIA DATA 0 B O O K 00-090-0 0 000900 000 00 00 00 0000 0900 000900 AREA MAP 0,000 0,000 0,000 0,000 00,000 0,000 0,000 0,000 0,000 0,000 0,000 0,000 0,000 0,000 0,000 0,000 0,000 0,000 00,000 0,000
More information2002 awk Aho,Weinberger,Kernighan DFA awk Brian Kernighan DFA GNU awk Arnold Robbins DFA NFA MKS awk Mortice Kern Systems POSIX NFA mawk Mike Brennan
153 167 2002 Processing Mechanism on Regular Expressions Yoshiyuki SAKAMOTO and Hiroyuki EDO awk NFA DFA DFANFA POSIX NFA DFA NFA NFA NFATcl, Perl, Python, GNU Emacs, ed, sed, vi, grep egrep, awk DFA egrep,
More information1 (2 * 3) 1 2 * 3 Preorder In order Post order 1 * 1 * Breadth-first Depth-first * * 3 Preorder: 1 * 2 3 In order: 1 2 * 3 Post orde
5 LL recursive descent LL(1) 2006.05.19 ::= ::= ::=
More information, ,279 w
No.482 DEC. 200315 14 1754,406 100.0 2160,279 w 100 90 80 70 60 50 40 30 20 10 28.9 23.8 25.0 19.3 30.4 25.0 29.5 80.7 75.0 75.0 70.5 71.1 69.6 76.2 7 8 9 10 11 12 13 23.2 76.8 14 14 1751,189 100.0 2156,574
More informationA(6, 13) B(1, 1) 65 y C 2 A(2, 1) B( 3, 2) C 66 x + 2y 1 = 0 2 A(1, 1) B(3, 0) P 67 3 A(3, 3) B(1, 2) C(4, 0) (1) ABC G (2) 3 A B C P 6
1 1 1.1 64 A6, 1) B1, 1) 65 C A, 1) B, ) C 66 + 1 = 0 A1, 1) B, 0) P 67 A, ) B1, ) C4, 0) 1) ABC G ) A B C P 64 A 1, 1) B, ) AB AB = 1) + 1) A 1, 1) 1 B, ) 1 65 66 65 C0, k) 66 1 p, p) 1 1 A B AB A 67
More information( ) ( ) 30 ( ) 27 [1] p LIFO(last in first out, ) (push) (pup) 1
() 2006 2 27 1 10 23 () 30 () 27 [1] p.97252 7 2 2.1 2.1.1 1 LIFO(last in first out, ) (push) (pup) 1 1: 2.1.2 1 List 4-1(p.100) stack[] stack top 1 2 (push) (pop) 1 2 void stack push(double val) val stack
More information76 3 B m n AB P m n AP : PB = m : n A P B P AB m : n m < n n AB Q Q m A B AQ : QB = m : n (m n) m > n m n Q AB m : n A B Q P AB Q AB 3. 3 A(1) B(3) C(
3 3.1 3.1.1 1 1 A P a 1 a P a P P(a) a P(a) a P(a) a a 0 a = a a < 0 a = a a < b a > b A a b a B b B b a b A a 3.1 A() B(5) AB = 5 = 3 A(3) B(1) AB = 3 1 = A(a) B(b) AB AB = b a 3.1 (1) A(6) B(1) () A(
More information一般演題(ポスター)
6 5 13 : 00 14 : 00 A μ 13 : 00 14 : 00 A β β β 13 : 00 14 : 00 A 13 : 00 14 : 00 A 13 : 00 14 : 00 A β 13 : 00 14 : 00 A β 13 : 00 14 : 00 A 13 : 00 14 : 00 A β 13 : 00 14 : 00 A 13 : 00 14 : 00 A
More informationA9R799F.tmp
!!!!! !!! " !!! ! "!!" " " ! ! " "!! "! " "!! !! !!! !!! ! !!!!! α ! "α!! "!! ! "α!! !! " " ! "! β ! ! "β " "! " " ! α λ !!!! ! """ ""! ! "!β"!!" ! ! "" ""! "!! !!!! ! " !! ! ! !"! "!! " ! ! α"!
More information1990 IMO 1990/1/15 1:00-4:00 1 N N N 1, N 1 N 2, N 2 N 3 N 3 2 x x + 52 = 3 x x , A, B, C 3,, A B, C 2,,,, 7, A, B, C
0 9 (1990 1999 ) 10 (2000 ) 1900 1994 1995 1999 2 SAT ACT 1 1990 IMO 1990/1/15 1:00-4:00 1 N 1990 9 N N 1, N 1 N 2, N 2 N 3 N 3 2 x 2 + 25x + 52 = 3 x 2 + 25x + 80 3 2, 3 0 4 A, B, C 3,, A B, C 2,,,, 7,
More informationA A3
818 A3 A3 8 A3 0100 0.Ma 1.5Ma 700s 70 IS 6g/6 1.0 1.5.0 01000100 0 0 0 SLBABCA CBCCCTATC 1 T Y S LB A B CA CC CB C TA TC CB TA/TC 63 0 1 0 1 0 0. 4. 8.14 1. 17.. 41.59 47.79 9.87 0.00779 0.009 0.05 0.01
More information1 8 Z80 Z GBA ASIC 2 WINDOWS C 1
1 8 Z80 Z80 20 8080 GBA ASIC 2 WINDOWS C 1 2.1 Z-80 A 0 - A 15 CPU Z80 D 0- D 7 I/O Z80 1: 1 (1) CPU CPU Z80 CPU Z80 AND,OR,NOT, (2) CPU (3) I/O () Z80 (4) 2 Z80 I/O 16 16 A 0, A 1,, A 15 (5) Z80I/O 8
More informationuntitled
II 4 Yacc Lex 2005 : 0 1 Yacc 20 Lex 1 20 traverse 1 %% 2 [0-9]+ { yylval.val = atoi((char*)yytext); return NUM; 3 "+" { return + ; 4 "*" { return * ; 5 "-" { return - ; 6 "/" { return / ; 7 [ \t] { /*
More information0 1
9 - -R -V -K - -V - -V 3 0 3 3 3 001 0 001 00 0 00 1 0 11 1 0 11 10 00 0 10 00 0 0 1 3 F X1CE G XCE CV Cm H X111CE C1V Cm C1.W J X1CE CV CV Cm E X1CE C1V Cm K X11CE C1V m V L X11BCE CV m 1.W C90V M XCE
More informationN1X Owner's Manual
N1X JA 2 N1X Bluetooth Bluetooth Bluetooth (bottom_ja_02) N1X 3 DMI-6 1/4 4 N1X N1X 5 DMI-6 2/4 6 N1X DMI-6 3/4 DMI-6 4/4 Bluetooth N1X 7 Bluetooth Bluetooth Bluetooth 8 N1X N1X BluetoothBluetooth N1X
More information日立液晶プロジェクター CP-AW2519NJ 取扱説明書- 詳細版-
PAGE UP DOWN D- ESC ENTER 1 1 2 2 3 COMPUTER IN1 USB TYPE A DC5V 0.5A USB TYPE B HDMI COMPUTER IN2 LAN CONTROL MONITOR OUT MIC AUDIO IN1 AUDIO IN3 AUDIO OUT R R L L S-VIDEO AUDIO IN2 VIDEO PAGE UP DOWN
More information4000/P4-25
4 5 ; ; ; ; ;; ; Q Q Q Q QQ Q ;; QQ ;Q ;; ;; QQ QQ ;; QQ Q ; Q;Q;Q ; 6 7 8 9 10 11 ; Q ;; QQ ;Q ;; QQ QQ ;; QQ ;; QQ ; Q 12 13 A ß ƒ u A A A 15 14 ;;;; ;;;; ;;;; ;;;; QQQQ QQQQ QQQQ QQQQ ;; ;; QQ QQ ;
More informationuntitled
0. =. =. (999). 3(983). (980). (985). (966). 3. := :=. A A. A A. := := 4 5 A B A B A B. A = B A B A B B A. A B A B, A B, B. AP { A, P } = { : A, P } = { A P }. A = {0, }, A, {0, }, {0}, {}, A {0}, {}.
More information1 # include < stdio.h> 2 # include < string.h> 3 4 int main (){ 5 char str [222]; 6 scanf ("%s", str ); 7 int n= strlen ( str ); 8 for ( int i=n -2; i
ABC066 / ARC077 writer: nuip 2017 7 1 For International Readers: English editorial starts from page 8. A : ringring a + b b + c a + c a, b, c a + b + c 1 # include < stdio.h> 2 3 int main (){ 4 int a,
More information05秋案内.indd
1 2 3 4 5 6 7 R01a U01a Q01a L01a M01b - M03b Y01a R02a U02a Q02a L02a M04b - M06b Y02a R03a U03a Q03a L03a M08a Y03a R04a U04a Q04a L04a M09a Y04a A01a L05b, L07b, R05a U05a Q05a M10a Y05b - Y07b L08b
More informationコンピュータ概論
4.1 For Check Point 1. For 2. 4.1.1 For (For) For = To Step (Next) 4.1.1 Next 4.1.1 4.1.2 1 i 10 For Next Cells(i,1) Cells(1, 1) Cells(2, 1) Cells(10, 1) 4.1.2 50 1. 2 1 10 3. 0 360 10 sin() 4.1.2 For
More informationI. Backus-Naur BNF S + S S * S S x S +, *, x BNF S (parse tree) : * x + x x S * S x + S S S x x (1) * x x * x (2) * + x x x (3) + x * x + x x (4) * *
2015 2015 07 30 10:30 12:00 I. I VI II. III. IV. a d V. VI. 80 100 60 1 I. Backus-Naur BNF S + S S * S S x S +, *, x BNF S (parse tree) : * x + x x S * S x + S S S x x (1) * x x * x (2) * + x x x (3) +
More information) 9 81
4 4.0 2000 ) 9 81 10 4.1 natural numbers 1, 2, 3, 4, 4.2, 3, 2, 1, 0, 1, 2, 3, integral numbers integers 1, 2, 3,, 3, 2, 1 1 4.3 4.3.1 ( ) m, n m 0 n m 82 rational numbers m 1 ( ) 3 = 3 1 4.3.2 3 5 = 2
More informationL
-G -VG -G -VG.MPa..MPa.1MPa..MPa 1.5MPa 1.5MPa 1.5MPa 1.5MPa 1 s 5 5 - -V 1.51MPa 1.5MPa s s..mpa.mpa 1.5MPa 1.5MPa - -V 1 s s 5 5 1 JISg/H 1. 1.5. 11 SLLBFFB SLLBFTC CCCCBTC..MPa 1.5MPa SLLBFFB CCCCBTC
More information04年度LS民法Ⅰ教材改訂版.PDF
?? A AB A B C AB A B A B A B A A B A 98 A B A B A B A B B A A B AB AB A B A BB A B A B A B A B A B A AB A B B A B AB A A C AB A C A A B A B B A B A B B A B A B B A B A B A B A B A B A B A B
More informationuntitled
I 3 2 4 2. 4 2. 2 4 2. 3 4 2. 4 4 2. 5 4 2. 6 4 2. 7 5 2. 8 5 2. 9 5 3. 8 3. 8 3.2 8 3.3 0 3.4 0 3.5 4 3.6 6 3.7 7 3.8 Lagmur 22 3.9 Freudlch 26 3.0 29 3. 30 3.2 36 4. 37 4. 37 4.2 37 4.3 39 4.4 4 5. DNA
More information熊本県数学問題正解
00 y O x Typed by L A TEX ε ( ) (00 ) 5 4 4 ( ) http://www.ocn.ne.jp/ oboetene/plan/. ( ) (009 ) ( ).. http://www.ocn.ne.jp/ oboetene/plan/eng.html 8 i i..................................... ( )0... (
More information?
240-8501 79-2 Email: nakamoto@ynu.ac.jp 1 3 1.1...................................... 3 1.2?................................. 6 1.3..................................... 8 1.4.......................................
More information(ver. 1.3 (2018) ) yacc 1 1 yacc yacc (Yet Another Compiler Compiler) UNIX yacc yacc y *.y yacc ) yacc *.tab.h *.tab.c C C yacc yacc UNIX yacc bison 2
(ver. 1.3 (2018) ) yacc 1 1 yacc yacc (Yet Another Compiler Compiler) UNIX yacc yacc y *.y yacc ) yacc *.tab.h *.tab.c C C yacc yacc UNIX yacc bison 2 yacc yacc lex %token yacc yacc token *.tab.h #define
More information4S795 68R7 68S79098B C1A 5648,.3,.3 0 23 23 9. 5648 79 0.3 9 1 2 ) 1 ) ) 1 ) 1 ) 1 ) ) ) 1 ) ) ) 1 ) 1 ) ) ) 1 ) 1 ) ) 1 6324.7=9S0 742SQ35.8C9=1 C1 ()) 2S 0( 0 S 0 0 5 )6 6 Q 5 Q ( 485 485 ( 7_4235._C1
More informationII 3 yacc (2) 2005 : Yacc 0 ~nakai/ipp2 1 C main main 1 NULL NULL for 2 (a) Yacc 2 (b) 2 3 y
II 3 yacc (2) 2005 : Yacc 0 ~nakai/ipp2 1 C 1 6 9 1 main main 1 NULL NULL 1 15 23 25 48 26 30 32 36 38 43 45 47 50 52 for 2 (a) 2 2 1 Yacc 2 (b) 2 3 yytext tmp2 ("") tmp2->next->word tmp2 yytext tmp2->next->word
More informationGRAPH2007.dvi
00 007 / 00 007 URL: http://chaosweb.complex.eng.hokudai.ac.jp/~j_inoue/index.html 7......................... 7..?....................... 7.................................... 9 7...............................................
More informationI II
I II I I 8 I I 5 I 5 9 I 6 6 I 7 7 I 8 87 I 9 96 I 7 I 8 I 9 I 7 I 95 I 5 I 6 II 7 6 II 8 II 9 59 II 67 II 76 II II 9 II 8 II 5 8 II 6 58 II 7 6 II 8 8 I.., < b, b, c, k, m. k + m + c + c b + k + m log
More information第86回日本感染症学会総会学術集会後抄録(II)
χ μ μ μ μ β β μ μ μ μ β μ μ μ β β β α β β β λ Ι β μ μ β Δ Δ Δ Δ Δ μ μ α φ φ φ α γ φ φ γ φ φ γ γδ φ γδ γ φ φ φ φ φ φ φ φ φ φ φ φ φ α γ γ γ α α α α α γ γ γ γ γ γ γ α γ α γ γ μ μ κ κ α α α β α
More informationB. 41 II: 2 ;; 4 B [ ] S 1 S 2 S 1 S O S 1 S P 2 3 P P : 2.13:
B. 41 II: ;; 4 B [] S 1 S S 1 S.1 O S 1 S 1.13 P 3 P 5 7 P.1:.13: 4 4.14 C d A B x l l d C B 1 l.14: AB A 1 B 0 AB 0 O OP = x P l AP BP AB AP BP 1 (.4)(.5) x l x sin = p l + x x l (.4)(.5) m d A x P O
More information17 18 2
17 18 2 18 2 8 17 4 1 8 1 2 16 16 4 1 17 3 31 16 2 1 2 3 17 6 16 18 1 11 4 1 5 21 26 2 6 37 43 11 58 69 5 252 28 3 1 1 3 1 3 2 3 3 4 4 4 5 5 6 5 2 6 1 6 2 16 28 3 29 3 30 30 1 30 2 32 3 36 4 38 5 43 6
More informationn ( (
1 2 27 6 1 1 m-mat@mathscihiroshima-uacjp 2 http://wwwmathscihiroshima-uacjp/~m-mat/teach/teachhtml 2 1 3 11 3 111 3 112 4 113 n 4 114 5 115 5 12 7 121 7 122 9 123 11 124 11 125 12 126 2 2 13 127 15 128
More information第85 回日本感染症学会総会学術集会後抄録(III)
β β α α α µ µ µ µ α α α α γ αβ α γ α α γ α γ µ µ β β β β β β β β β µ β α µ µ µ β β µ µ µ µ µ µ γ γ γ γ γ γ µ α β γ β β µ µ µ µ µ β β µ β β µ α β β µ µµ β µ µ µ µ µ µ λ µ µ β µ µ µ µ µ µ µ µ
More information1
005 11 http://www.hyuki.com/girl/ http://www.hyuki.com/story/tetora.html http://www.hyuki.com/ Hiroshi Yuki c 005, All rights reserved. 1 1 3 (a + b)(a b) = a b (x + y)(x y) = x y a b x y a b x y 4 5 6
More information: gettoken(1) module P = Printf exception End_of_system (* *) let _ISTREAM = ref stdin let ch = ref ( ) let read () = (let c =!ch in ch := inp
7 OCaml () 1. 2. () (compiler) (interpreter) 2 OCaml (syntax) (BNF,backus normal form ) 1 + 2; let x be 2-1 in x; ::= ; let be in ; ::= + - ::= * / ::= 7.1 ( (printable characters) (tokens) 1 (lexical
More informationNU1X 取扱説明書
JA 2 NU1X Bluetooth Bluetooth NU1X 3 DMI-6 1/4 4 NU1X NU1X 5 DMI-6 2/4 6 NU1X DMI-6 3/4 DMI-6 4/4 NU1X 7 Bluetooth Bluetooth Bluetooth (bottom_ja_02) 8 NU1X NU1X BluetoothBluetooth NU1X 9 10 NU1X w e r
More information記号と準備
tbasic.org * 1 [2017 6 ] 1 2 1.1................................................ 2 1.2................................................ 2 1.3.............................................. 3 2 5 2.1............................................
More information1 4 2 (1) (B4:B6) (2) (B12:B14) (3) 1 (D4:H4) D5:H243 (4) 240 20 (B8:B10) (5) 240 (B8) 0 1
4 1 4 (1) (2) (3) (4) 1 4 2 (1) (B4:B6) (2) (B12:B14) (3) 1 (D4:H4) D5:H243 (4) 240 20 (B8:B10) (5) 240 (B8) 0 1 4 3 2 2.1 2 Excel 2 (A1:A14 D3:H3 B4,B5,B6) B5 0.035 4 4 2.2 3 1 1 B12: =B5+1 B13: =B12
More informationP (32LX10)
D D D D D D C Matsushita Electric Industrial Co., Ltd. D D D 2 04 D 08 D 10 D A A A A 16 D 17 D 18 D A 19 D A A A A 26 417 1825 2641 D A A A A 35 D 36 D A A 38 D 41 D 42 D 51 D 52 D 54 D 56 D A A 64 D
More informationC C C - J TH-D TH-D TH-D C C C C C - J TH-D TH-D TH-D C - J TH-D TH-D TH-D C C C C
C Matsushita Electric Industrial Co., Ltd. - J TH-D TH-D TH-D C C C C - J TH-D TH-D TH-D C C C C C - J TH-D TH-D TH-D C - J TH-D TH-D TH-D C C C C - J FGIH FGIH FG IH FGIH F G FGIH - J c c c c c c C C
More informationx, y x 3 y xy 3 x 2 y + xy 2 x 3 + y 3 = x 3 y xy 3 x 2 y + xy 2 x 3 + y 3 = 15 xy (x y) (x + y) xy (x y) (x y) ( x 2 + xy + y 2) = 15 (x y)
x, y x 3 y xy 3 x 2 y + xy 2 x 3 + y 3 = 15 1 1977 x 3 y xy 3 x 2 y + xy 2 x 3 + y 3 = 15 xy (x y) (x + y) xy (x y) (x y) ( x 2 + xy + y 2) = 15 (x y) ( x 2 y + xy 2 x 2 2xy y 2) = 15 (x y) (x + y) (xy
More information(1) θ a = 5(cm) θ c = 4(cm) b = 3(cm) (2) ABC A A BC AD 10cm BC B D C 99 (1) A B 10m O AOB 37 sin 37 = cos 37 = tan 37
4. 98 () θ a = 5(cm) θ c = 4(cm) b = (cm) () D 0cm 0 60 D 99 () 0m O O 7 sin 7 = 0.60 cos 7 = 0.799 tan 7 = 0.754 () xkm km R km 00 () θ cos θ = sin θ = () θ sin θ = 4 tan θ = () 0 < x < 90 tan x = 4 sin
More informationTK747取扱説明書
D D D D D D D E D D D D D D D D ; ; ; ; ; ; ; ; ; ; ; ; ; D D D D D D D D C C C C C ;;;;; ;;;;; ;;;;; ;;;;; ;;;;; ;;;;; ;;;;; ;;;;; ;;;;; ;;;;; ;;;;; ;;;;; ;;;;; C C C C C C C C C C C C C C C C C D D D
More information橡CompSimmAllcpct.PDF
3 1 M dx 1 dx/ 1/ x P 0 (x) x dx x P 0 (x) x+dx P 0 (x+dx) x dx P 0 (x+dx)=p 0 (x)(1-dx/ dx/) x P 0 (x) P 0 (x+dx)=p 0 (x)(1-dx/ dx/) Tayler (dx) P 0 (x)+(dp 0 /dx)dx (dp 0 (x)/dx)dx= -P 0 (x) dx/
More information:30 12:00 I. I VI II. III. IV. a d V. VI
2017 2017 08 03 10:30 12:00 I. I VI II. III. IV. a d V. VI. 80 100 60 1 I. Backus-Naur BNF X [ S ] a S S ; X X X, S [, a, ], ; BNF X (parse tree) (1) [a;a] (2) [[a]] (3) [a;[a]] (4) [[a];a] : [a] X 2 222222
More informationPROSTAGE[プロステージ]
PROSTAGE & L 2 3200 650 2078 Storage system Panel system 3 esk system 2 250 22 01 125 1 2013-2014 esk System 2 L4OA V 01 2 L V L V OA 4 3240 32 2 7 4 OA P202 MG55 MG57 MG56 MJ58 MG45 MG55 MB95 Z712 MG57
More information2012 A, N, Z, Q, R, C
2012 A, N, Z, Q, R, C 1 2009 9 2 2011 2 3 2012 9 1 2 2 5 3 11 4 16 5 22 6 25 7 29 8 32 1 1 1.1 3 1 1 1 1 1 1? 3 3 3 3 3 3 3 1 1, 1 1 + 1 1 1+1 2 2 1 2+1 3 2 N 1.2 N (i) 2 a b a 1 b a < b a b b a a b (ii)
More information