Flat Splicing Array Grammar Systems Generating Picture Arrays

Size: px
Start display at page:

Download "Flat Splicing Array Grammar Systems Generating Picture Arrays"

Transcription

1 Intrntionl Journl of Computr Informtion Systms n Inustril Mngmnt Applictions. ISSN Volum 8 (2016) pp c MIR Ls, Flt Splicing Arry Grmmr Systms Gnrting Pictur Arrys G. Smnilthompson 1, N. Gnnmlr Dvi 1, Atuly K. Ngr 2 n K.G. Surmnin 2 1 Dprtmnt of Mthmtics, Mrs Christin Collg, Tmrm, Chnni Ini {smnilthompson,ngmcc}@gmil.com 2 Dprtmnt of Mthmtics n Computr Scinc, Fculty of Scinc, Livrpool Hop Univrsity, Livrpool, L16 9JD, UK ngr@hop.c.uk, kgsmni1948@yhoo.com Astrct: Whil stuying th rcominnt hviour of DNA molculs, H (1987) introuc nw oprtion, cll s- plicing on wors or strings, which r finit squncs of symols. Thr hs n intnsiv rsrch using th concpt of splicing on strings in th contxt of DNA computing, stlishing importnt thorticl rsults on computtionl univrslity. A prticulr clss of splicing, known s flt splicing on strings ws rcntly consir n this oprtion ws xtn to provi pictur rry gnrting two-imnsionl mols. Mking us of th oprtion of flt splicing on rrys, w propos hr grmmr systm, cll flt splicing rgulr rry grmmr systm (FSRAGS), s nw mol of pictur gnrtion. Th componnts of FSRAGS gnrt pictur rrys working in prlll using th ruls of two-phs grmmr cll 2RLG n with two iffrnt componnts of th FSRAGS communicting using th rry flt splicing oprtions on columns n rows of th rrys. W stlish som comprison rsults ringing out th gnrtiv powr of FSRAGS n lso xhiit th powr of FSRAGS in gnrting crtin floor signs. Kywors: Flt splicing, Pictur rry, Pictur lngug, Forml lngugs, Grmmrs, Grmmr systms I. Introuction In th qust for crting ltrntivs for th clssicl silicons computing, th fil of DNA computing [13, 14], sis othrs, ws orn with Almn solving smll instnc of Hmilton pth prolm [1] s on th us of DNA molculs n oprtions on DNA squncs. In th stuy of molling th DNA rcomintion procss unr th ction of rstriction nzyms n ligs, H [8] strct this phnomnon in his sminl ppr on forml mol of th rcominnt hviour of DNA molculs n fin th oprtion of splicing of wors, which r strings of symols. This oprtion of splicing of two wors u = u 1 u 2 n v = v 1 v 2 involvs cutting u, twn u 1 n u 2 n v, twn v 1 n v 2, s ictt y crtin ruls known s splicing ruls n psting th prfix u 1 of u with th suffix v 2 of v yiling nw wor w = u 1 v 2. Susquntly, this opn up svrl thorticl invstigtions [6, 10, 11] giving ris to importnt n p lngug-thortic rsults in th r of forml lngug thory, which is wily ccpt to th ckon [5, 12] of thorticl computr scinc. Bs on th fct tht DNA occur in circulr form, H [9, 10] introuc th oprtion of splicing on circulr wors. Motivt y spcific form of splicing on circulr wors, rcntly, iffrnt form of splicing, cll flt splicing on wors hs n introuc in [2]. Th oprtion of flt splicing on pir of wors (α, β) involvs cutting α n insrting β into it, s irct y rul, cll flt splicing rul. Inspir y prolms in img procssing, svrl gnrtiv mols of two-imnsionl pictur rrys s on lngug thory, hv n propos n stui (s, for xmpl, [7, 15, 16, 21, 24]). Rcntly, th oprtion of flt splicing on wors hs n xtn to pictur rrys [23] n n rry flt splicing systm (AF S) hs n fin to scri pictur rry lngugs. On th othr hn, th notion of grmmr systm consisting of svrl grmmrs or othr lngug intifying mchnisms cooprting ccoring to som wll-fin protocol, ws introuc s forml frmwork for molling istriut complx systms [3]. Bs on iffrnt motivtions, vrity of grmmr systm mols hv n propos n intnsivly invstigt. A iffrnt typ of grmmr systm, cll Splicing Grmmr Systm ws introuc in [4] with th componnt grmmrs working in prlll n communiction twn componnts ing on y th io-inspir oprtion of splicing on strings of symols introuc y H [8]. This systm ws xtn to rrys in [22] y introucing splicing rry grmmr systm. Hr w mk us of th rry flt splicing oprtion n introuc grmmr systm cll flt splicing rgulr rry grmmr systm (F SRAGS) n xmin th powr MIR Ls, USA

2 337 Smnilthompson t l. of this systm in gnrting pictur rry lngugs. Th componnts of th F SRAGS involv th ruls of th twophs grmmr 2RLG [7, 19] working in prlll n th rry flt splicing oprtion [23] is us for communiction mong two iffrnt componnts in trms of insrtion of n rry gnrt in componnt into n rry gnrt in iffrnt componnt. W stlish som comprison rsults ringing out th powr of (F SRAGS). W lso xhiit th us of (F SRAGS) in gnrting crtin floor signs. A prliminry vrsion of this ppr pprs in [18]. II. Prliminris For notions n rsults rlt to forml string lngugs n rry lngugs, w rfr to [7, 17]. A linr wor or simply, wor w = 1 2 n is finit squnc of symols i, 1 i n, tkn from finit lpht Σ. Th mpty wor with no symols, is not y λ. Th st of ll wors ovr Σ is not y Σ. Th lngth w of wor w is th numr of symols in th wor, incluing rptitions of symols. For xmpl,th lngth of th wor is 5. For ny wor w, w not y t w th wor w writtn vrticlly. For xmpl, if w = ovr {, }, thn t w = A pictur rry or simply, n rry M of siz m n ovr n lpht Σ is rctngulr rry with m rows n n columns n is of th form M = 11 1n..... m1 mn whr ch symol ij Σ, 1 i m, 1 j n. W not y M r n M c, th numr of rows n th numr of columns of M rspctivly. Th st of ll rctngulr rrys ovr Σ is not y Σ, which inclus lso th mpty rry λ with no symols. Σ ++ = Σ {λ}. A pictur lngug is sust of Σ. Th column ctntion X Y of n rry X of siz p q n n rry Y of r s is fin only whn p = r n likwis th row ctntion X Y is fin only whn q = s. In othr wors, in column ctntion X Y, Y is ttch to th right of X whil in row ctntion X Y, Y is ttch low X. Also X λ = λ X = X λ = λ X = X, for vry rry X. For xmpl, if X =, Y =., Z = thn X Y =, Y Z = An rry grmmr mol of th non-isomtric vrity gnrting rctngulr rrys of symols is th two-imnsionl right-linr grmmr (originlly cll 2D mtrix grmmr [19]), which w cll hr s two-imnsionl right-linr grmmr, consistnt with th trminology us in [7]. Dfinition 1 A two-imnsionl right-linr grmmr (2RLG) [7, 19] is G = (V h, V v, V i, T, S, R h, R v ) whr V h, V v, V i r finit sts of symols, rspctivly cll s horizontl nontrminls, vrticl nontrminls n intrmit symols; V i V v ; T is finit st of trminls; S V h is th strt symol; R h is finit st of horizontl ruls of th form X AY, X A X, Y V h, A V i ; R v is finit st of vrticl ruls of th form X Y or X, X, Y V i, T λ. Thr r two phss of rivtion in 2RLG. In th first horizontl phs, strting with S th horizontl ruls r ppli (s in rgulr grmmr) gnrting strings ovr intrmits, which ct s trminls of this phs. In th scon vrticl phs ch intrmit in such string srvs s th strt symol for th scon phs. Th vrticl ruls r ppli in prlll in this phs for gnrting th columns of th rctngulr rrys ovr trminls. In this phs t rivtion stp, ithr ll th ruls ppli r of th form X Y, T or ll th ruls r of th form X Y or ll th ruls r th trminting vrticl ruls of th form X, T or ll of th form X λ. Whn th vrticl gnrtion hlts, th rry otin ovr T, is collct in th pictur lngug gnrt y th 2RLG. Not tht th pictur lngug gnrt y 2RLG consists of rctngulr rrys of symols. W not y L(2RLG) th fmily of rry lngugs gnrt y two-imnsionl right-linr grmmrs. W illustrt th working of 2RLG with n xmpl. Exmpl 1 Consir th 2RLG G L with rgulr horizontl ruls S AX, X BX, X B whr A, B r th intrmit symols n th vrticl ruls A A, A, B B, B whr, r th trminl symols. In th first phs, s in string grmmr, th horizontl ruls gnrt wors of th form AB n, n 1. For xmpl, th gnrtion of AB 3 is s givn low: S AX ABX ABBX ABBB = AB 3 on pplying th thr horizontl ruls on ftr nothr, with th rul X BX ppli twic. In th scon phs vry symol in such wor AB n is rwrittn in prlll ithr y using th ruls A A, B B in which cs th rivtion cn likwis continu ing rows of th form or y using th ruls A, B,

3 Flt Splicing Arry Grmmr Systms Gnrting Pictur Arrys 338 in which cs th rivtion trmints ing row of th form, thus gnrting pictur rrys, on mmr of which is shown in Fig. 1. In fct, for this pictur rry, th rivtion in th scon phs is s follows: A B B B A B B B A B B B A B B B on pplying th nontrminl ruls A A, B B. Whn th trminl ruls A, B B, B r ppli togthr, rivtion trmints yiling th rry in Fig. 1. Figur. 1: A pictur rry gnrt in Exmpl 1 An xtnsion of th 2RLG, which w cll hr s two-imnsionl tl right-linr grmmr (2T RLG) (originlly rfrr to s 2D tl mtrix grmmr in [20]) ws introuc in [20] to gnrt pictur lngugs tht cnnot gnrt y ny 2RLG. A 2T RLG is fin similr to 2RLG with th following iffrnc: In th scon phs, th right-linr ruls r group into iffrnt sts, cll tls such tht i) ll th ruls in tl r nontrminl ruls of th form ithr A B only or A B only or ii) ll r trminl ruls of th form ithr A only or A λ only n t tim ruls from only on tl r us in th scon phs. W not y L(2T RLG) th fmily of rry lngugs gnrt y two-imnsionl tl right-linr grmmrs. As n illustrtion, w giv n xmpl of 2T RLG. Exmpl 2 Consir th 2T RLG G H with rgulr horizontl ruls S AX, X BX, X BY, Y A whr A, B r th intrmit symols n th tls of vrticl ruls r t 1 = {A A, B B}, t 2 = {A C, B cd}, t 3 = {C C, D D}, t 4 = {C, D } whr,, c r th trminl symols. In th first phs, th horizontl ruls gnrt wors of th form AB n A, n 1. In th scon phs vry symol in such wor AB n A is rwrittn in prlll y using th tls of ruls. Appliction of th tl t 1 crtin numr of tims, follow y t 2 onc which is thn follow y t 3 gin crtin numr of tims n finlly trminting th rivtion in this scon phs, gnrts pictur rrys, on mmr of which is shown in Fig. 2. An oprtion, cll flt splicing on linr wors, is consir y Brstl t l. [2]. A flt splicing rul r is of th form (α γ δ β), whr α, β, γ, δ r wors ovr givn lpht Σ. For two wors u = xαβy, v = γzδ, n ppliction of th flt splicing rul r = (α γ δ β) to th pir (u, v) yils th wor w = xαγzδβy. In othr wors, th scon wor v c c c c Figur. 2: A pictur rry gnrt in Exmpl 2 is insrt twn α n β in th first wor u s rsult of pplying th rul r. Th notion of flt splicing on wors [2] hs n xtn to rrys in [23], y introucing two kins of flt splicing ruls, cll column flt splicing rul n row flt splicing rul n thus nw mol of pictur gnrtion, cll rry flt splicing systm is introuc in [23]. Dfinition 2 [23] Lt V n lpht. (i) A column flt splicing rul is of th form ( t ( 1 2 ) t (x 1 x 2 ) t (y 1 y 2 ) t ( 1 2 )) whr 1, 2, 1, 2 Σ {λ} with 1 = 2 n 1 = 2, x 1, x 2, y 1, y 2 Σ {λ} with x 1 = x 2 n y 1 = y 2. (ii) A row flt splicing rul is of th form (c 1 c 2 u 1 u 2 v 1 v ) whr c 1, c 2, 1, 2 Σ {λ} with c 1 = c 2 n 1 = 2, u 1, u 2, v 1, v 2 Σ {λ} with u 1 = u 2 n v 1 = v 2. (iii) Lt r 1, r 2,, r m 1 squnc of (m 1) column flt splicing ruls givn y r i = ( t (α i α i+1 ) t (γ i γ i+1 ) t (δ i δ i+1 ) t (β i β i+1 )), for 1 i (m 1). Lt X, Y two pictur rrys, ch with m rows, for som m 1, n givn y X = X 1 t (α 1 α 2 α m ) t (β 1 β 2 β m ) X 2, Y = t (γ 1 γ 2 γ m ) Y t (δ 1 δ 2 δ m ), whr X 1, X 2, Y r rrys ovr Σ with m rows, α i, β i, Σ {λ} (1 i m), with α 1 = α 2 = = α m, β 1 = β 2 = = β m, γ i, δ i, (1 i m), Σ {λ} with γ 1 = γ 2 = = γ m, δ 1 = δ 2 = = δ m. An ppliction of th column flt splicing ruls r 1, r 2,, r m 1 to th pir of rrys (X, Y ) yils th rry Z = X 1 t (α 1 α 2 α m ) t (γ 1 γ 2 γ m ) Y t (δ 1 δ 2 δ m ) t (β 1 β 2 β m ) X 2. Th pir (X, Y ) yiling Z (X, Y ) c Z. is thn not y (iv) Lt s 1, s 2,, s n 1 squnc of (n 1) row flt splicing ruls givn y s j = (η j η j+1 (µ j µ j+1 ) (ν j ν j+1 ) θ j θ j+1 ),

4 339 Smnilthompson t l. for 1 j (n 1). Lt U, V two pictur rrys, ch with n columns, for som n 1, n givn y U = U 1 (η 1 η 2 η n ) (θ 1 θ 2 θ n ) U 2, V = (µ 1 µ 2 µ n ) V (δ 1 δ 2 δ n ) whr U 1, U 2, V r rrys ovr Σ with n columns, η j, θ j, (1 j n), Σ {λ} with η 1 = η 2 = = η n, θ 1 = θ 2 = = θ n, µ j, ν j, (1 j n), Σ {λ} with µ 1 = µ 2 = = µ n, ν 1 = ν 2 = = ν n. An ppliction of th row flt splicing ruls s 1, s 2,, s n 1 to th pir of rrys (U, V ) yils th rry W = U 1 (η 1 η 2 η n ) (µ 1 µ 2 µ n ) V (δ 1 δ 2 δ n ) (θ 1 θ 2 θ n ) U 2. Th pir (U, V ) yiling W (U, V ) r W. is thn not y (v) An rry flt splicing rul is ithr column flt splicing rul or row flt splicing rul. Th nottion nots ithr c or r. (vi) For pictur lngug L Σ n st R of rry flt splicing ruls, w fin f(l) = {M Σ (X, Y ) M, forx, Y L, n som rul in R}. (vii) An rry flt splicing systm (AF S) is A = (Σ, M, R c, R r ) whr Σ is n lpht, M is finit st of rrys ovr Σ, cll initil st, R c is finit st of column flt splicing ruls n R r is finit st of row flt splicing ruls. Th pictur lngug L(A) gnrt y A is itrtivly fin s follows: f 0 (M) = M; For i 0, f i+1 (M) = f i (M) f(f i (M)); L(A) = f (M) = i 0 f i (M). Th fmily of pictur lngugs gnrt y rry flt splicing systms is not y L(AF S). An illustrtion of th ppliction of column n row flt splicing ruls s wll s th working of n rry flt splicing systm is givn in th following xmpl. Exmpl 3 Consir th rry flt splicing systm A R with lpht {, } n th initil st consisting of th rry M = { }. Th column flt splicing rul is c whr c = ( ). Th row flt splicing ruls r r 1, r 2, r 3 whr r 1 = ( ), r 2 = ( ), r 3 = ( ). Th column flt splicing rul c is pplicl to th pir (M, M). Not tht oth th componnts in th pir ing th sm initil rry M, th rquirmnt of qul numr of rows for th ppliction of column flt splicing rul c is stisfi. Also th scon rry in th pir gins with th column n ns with th column, s rquir in th rul c. Th first rry is cut twn th columns n whil th scon rry is insrt twn thm, yiling th rry. On th othr hn, th row flt splicing ruls r 1, r 2 cn us to xpn th rry rowwis. For xmpl, th squnc of ruls r 1, r 2, r 3 coul ppli to th pir of rrys with oth componnts hving th sm rry. Agin not tht oth th componnts in th pir ing th sm rry, th rquirmnt of qul numr of columns for th ppliction of squnc of row flt splicing ruls, is stisfi. In fct, th first rry is cut twn th first row n th scon row which is lso. Th scon rry stisfis th rquirmnts of th squnc of ruls r 1, r 2, r 3. Th scon rry thrfor cn insrt into th first rry to yil th rry. Procing lik this, w comput th succssiv trms f 0 (M), f 1 (M),. In fct f 0 (M) = M = { }, f 1 (M) = M f(m) = {,,., }, Thus th pictur lngug L(A R ) = f (M) consists of rctngulr rrys of vn si lngth ovr th symols,. Also if th numr of columns in such n rry is 2n, thn th first n columns r ovr whil th nxt n columns r ovr. Figur. 3: A mmr of th lngug of A R On such pictur rry is shown in Fig. 3. III. Flt Splicing Rgulr Arry Grmmr Systm W now introuc nw mol of pictur gnrtion, cll flt splicing rry grmnmr systm. Dfinition 3 A flt splicing rgulr rry grmmr systm (F SAGS) is construct G s = (V h, V v, V i, T, (S 1, R h 1, R v 1),..., (S n, R h n, R v n), F ) whr V h, V v, V i r rspctivly, th finit sts of horizontl, vrticl n intrmit nontrminls; V i V v ; T is th trminl lpht; S i, 1 i n is th strt symol of

5 Flt Splicing Arry Grmmr Systms Gnrting Pictur Arrys 340 th corrsponing componnt; Ri h, 1 i n is finit st of horizontl ruls, which r rgulr of th forms X AY, X A, X, Y V h, A V i ; Ri v, 1 i n is finit st of right-linr vrticl ruls of th forms A B, A B, A, A, B V v, T ; F is finit st of rry flt splicing ruls Th rivtions tk plc in two phss s follows : Ech componnt grmmr gnrts wor cll intrmit wor, ovr intrmits strting from its own strt symol n using its horizontl ruls ; th rivtions in this phs r on with th componnt grmmrs working in prlll. In th scon phs ny of th following stps cn tk plc: (i) ch componnt grmmr cn rwrit s in two imnsionl mtrix grmmr using th vrticl ruls, s- trting from its own intrmit wor gnrt in th first phs. (Th componnt grmmrs rwrit in prlll n th ruls r ppli togthr). Not tht th componnt grmmrs togthr trmint with ll ruls us in th form A or togthr continu rwriting in th vrticl irction with ll ruls us ithr in th form A B or in th form A B. (ii) At ny instnt th pictur rry X gnrt in th i th componnt for som i, 1 i n n th pictur rry Y gnrt in th j th componnt for som j, 1 j n cn flt splic using rry flt splicing ruls, ithr column or row flt splicing ruls s in finition 2, thus yiling pictur rry Z in i th componnt. In ny othr componnt (othr thn i th componnt), th rrys gnrt t this instnt will rmin unchng uring this flt splicing procss. Thr is no priority twn stps (i) n (ii). Th lngug L i (G s ) gnrt y th ith componnt of G s consists of ll pictur rrys, gnrt ovr T, y th rivtions scri ov. This lngug will cll th iniviul pictur rry lngug of th systm n w my choos this to th lngug of th first componnt. Th fmily of iniviul pictur rry lngugs gnrt y F SRAGS with t most n componnts is not y L n (F SRAGS). W illustrt th working of F SRAGS with n xmpl. Exmpl 4 Consir th F SAGS G 1 with two componnts givn y whr ({S 1, S 2, X, Y }, {A, C, D}, {A, C, D}, {, c, }, (S 1, R h 1, R v 1), (S 2, R h 2, R v 2), F ) R h 1 = {S 1 AX, X CX, X A, }, R h 2 = {S 2 Z, Z DZ, Z D}, R v 1 = {A A, C cc, A, C c}, R v 2 = {A A, D D, A, D } c c c c c c c c c c c c () () Figur. 4: () Pictur rry gnrt in th first componnt of G 1 () Pictur rry gnrt in th scon componnt of G 1 c c c c c c c c c c c c Figur. 5: A pictur rry gnrt y G 1 n F consists of th column flt splicing rul c 1 = ( c c ). Strting from S 1, th horizontl rgulr ruls in th first componnt gnrt wor of th form AC n 1 A on pplying th rul S 1 AX onc follow y th ppliction of th rul X CX (n 1) tims n finlly th rul X A onc, trminting th rivtion in th first componnt in th horizontl phs. At th sm tim in th scon componnt rivtions in th horizontl phs tk plc in prlll strting from S 2 n pplying th rul S 2 Z onc follow y th ppliction of th rul Z DZ (n 1) tims n finlly th rul Z D onc, yiling th wor D n for th sm n. In th scon phs vrticl rivtions in oth th componnts tk plc in prlll. In th first componnt n m (n + 1) pictur rry s in Fig. 4() is gnrt whil in th scon componnt n m n pictur rry s in Fig. 4() is gnrt. At this point, using th column flt splicing rul c 1 s mny tims s n, th rry in Fig. 4() is insrt in th rry in Fig. 4() twn th first column of s n th scon column of c s to yil pictur rry of th form s in Fig. 5. Thorm 1 L 2 (F SRAGS) \ L(AF S). Proof 1 Th pictur rry lngug L gnrt y th F SRAGS G 1 in Exmpl 4 consists of pictur rrys M ch of which hs th following proprty P : M hs xctly two columns of s with on, th lftmost column n th othr, th rightmost column, sis othr columns m of ithr c s or s. But L cnnot gnrt y ny AF S sinc th flt splicing ruls will insrt on rry of L into nothr, thry yiling pictur rrys which will violt th proprty mntion ov. Thorm 2 L(2RLG) = L 1 (F SRAGS) L 2 (F SRAGS).

6 341 Smnilthompson t l. Proof 2 Th qulity L(2RLG) = L 1 (F SRAGS) follows y noting tht th F SRAGS with on componnt will hv rwriting ruls s in 2RLG n th st of rry flt s- plicing ruls cn tkn to n mpty st s ths ruls cn ppli only whn thr r t lst two componnts. Th pictur rry lngug L of Exmpl 4, is gnrt y F SRAGS with two componnts. An rry of L hs th proprty tht thr r (n + 1) conscutiv columns of s (strting from th scon column) follow y n columns of c s. But this proprty which involvs proportion in th numr of columns of c s n th numr of columns of s (nlogous to th contxt-fr string lngug { (n+1) c n n 1}) cnnot mintin y rgulr horizontl ruls of 2RLG n hnc L cnnot gnrt y ny 2RLG. Sinc L(2RLG) = L 1 (F SRAGS) it follows tht ny F SRAGS with only on componnt cnnot gnrt th pictur rry lngug L. This provs th propr inclusion L 1 (F SRAGS) L 2 (F SRAGS). Thorm 3 L 2 (F SRAGS) \ L(2T RLG) Proof 3 As not in th proof of Thorm 2, th pictur rry lngug L of Exmpl 4, which is gnrt y F SRAGS with two componnts, hs th ftur tht n rry of L involvs proportion in th numr of columns of c s n th numr of columns of s. This proprty cnnot hnl y ny 2T RLG s th ruls in th first phs of 2T RLG r only rgulr ruls. Thus L cnnot gnrt y ny 2T RLG. In [20], nlogous to 2T RLG, two-imnsionl grmmr, hr cll two-imnsionl tl contxt-fr grmmr 2T CF G (originlly cll 2D tl CF mtrix grmmr) ws consir in [20] n this 2D grmmr hs contxt-fr grmmr kin of ruls in th first phs whil th scon phs hs tls of right-linr ruls s in 2T RLG. Drivtions r on s in 2T RLG. W not y L(2T CF G), th fmily of pictur rry lngugs gnrt y 2T CF G. Also, whn thr r xctly two tls in th scon phs of 2T CF G, with on tl consisting of ll right-linr ruls of th form A B n nothr tl consisting of ll trminl ruls of th form A, whr A, B r nontrminls n is trminl symol, th 2T RLG is in 2RLG. W now show tht th fmily L 3 (F SRAGS) of pictur lngugs gnrt y flt splicing rgulr rry grmmr systms with thr componnts,contins pictur lngugs tht cnnot gnrt y ny 2T CF G. Thorm 4 L 3 (F SRAGS) \ L(2T CF G) Proof 4 Consir th pictur rry lngug L 2 whos lmnts r pictur rrys with two rows of th forms or M 1 = M 2 = c c c c with th columns of s ing qul in numr to th columns of s in th formr rry whil this numr lso quls th numr of columns of c s in th lttr rry. This kin of pictur lngug cnnot gnrt y ny 2T CF G s th ftur prsnt in th rrys of th form M 2, nmly, qul numr of columns of s, s n c s is nlogous to th contxt-snsitiv string lngug { n n c n n 1} cnnot hnl y th contxt-fr kin of ruls in th first phs of 2T CF G. But th lngug L 2 is gnrt y th following F SRAGS G 2 with thr componnts: Dfin whr G 2 = (V h, V v, V i, T, (S 1, R h 1, R v 1), (S 2, R h 2, R v 2), (S 3, R h 3, R v 3), F ) T = {,, c,,, f}, V h = {S 1, S 2, S 3, X, Y, Z}, V i = {A, D, B, E, C, F }, V v = {A, D, B, E, C, F, A, D, B, E, C, F, A, D, B, E, C, F }. R h 1 = {S 1 AS 1, S 1 AX, X D}, R h 2 = {S 2 BS 2, S 2 BY, Y E}, R h 3 = {S 3 CS 3, S 3 CZ, Z F }, R v 1 = {A A, D D, A A, B B, D D, E E, A, B, D, E, C c, F f} R v 2 = {B B, E E, B B, E E, B, E } R v 3 = {C c C, F f F, C C, F F, C c, F f} F consists of th following column flt splicing ruls: ( A B E D ), ( B c C f F E ) Drivtions in th thr componnts tk plc in prlll with th ppliction of th horizontl ruls S 1 AS 1, S 1 AX, X D in th first componnt yiling th wor A n D for som n 1, whil, likwis, in th scon n thir componnts, th horizontl ruls yil rspctivly th wors B n E n C n F. At tim ll thr wors riv involv th sm n. If th vrticl ruls A A, D D A D in th first componnt r ppli, n rry of th form A is gnrt in th first componnt whil, likwis, ppliction of similr ruls in th scon n thir componnts gnrt th rrys rspctivly c c f of th forms B B E n C C F. If t this stg, th column flt splicing rul ( A E D ) is ppli, thn th rry otin is of th form A B A B B E D If now th vrticl

7 Flt Splicing Arry Grmmr Systms Gnrting Pictur Arrys 342 u u u u u u u u l h r u u u u u u u u l h r Figur. 8: A pictur rry gnrt y G F using rry flt splicing Figur. 6: A floor sign u u u u l h u u u u l h Figur. 9: A pictur rry gnrt y G F givn in Fig. 8, long with pictur rrys s th on givn in Fig. 9, cn gnrt y F SRAGS G F with two componnts. W o not giv th forml tils of G F ut informlly scri th i. Figur. 7: Primitiv Pttrns ruls such s A A tht chng th prim symols into oul prim symols r ppli follow y th ppliction of trminl ruls, thn pictur rrys of th form r gnrt which r collct in th pictur lngug of G 2. On th othrhn, prior to th ppliction of th trminl ruls, if th column flt splicing rul ( c B C f F E ) is ppli n th oul prim symols r chng into trminls y th ppliction of trminl ruls, thn rrys of th form c c c c r gnrt n r lso collct in th pictur lngug of G 2. IV. Appliction to Gnrtion of Floor Dsigns Gnrtion of crtin pictur pttrns, such s floor signs (s, for xmpl, Fig. 6), using rry gnrting grmmr mols hs n on [19]. Th i is to consir th pictur pttrn s n rry ovr crtin trminl symols n gnrt th rry with n rry grmmr. Thn sustitut for ch symol som rlvnt primitiv pttrn of th pictur to gnrt, yiling th pttrn. Hr w xplin how to construct F SRAGS with two componnts to gnrt th collction of floor signs, on mmr of which is shown in Fig. 6. Th primitiv pttrns involv in this floor sign r shown in Fig. 7. Th pictur rry ncoing th floor sign is givn in Fig. 8. Th pictur rry lngug consisting of pictur rrys such s th on f f Th i is to llow th first componnt gnrt th lft hlf of th pictur rry (with th rightmost column m of only h ) whil th scon componnt gnrts th scon hlf n rry flt splicing ruls r crt to conctnt th right hlf to th right of th lft hlf, yiling th pictur rry of th form in Fig. 8. Whn th rlvnt primitiv pttrns r sustitut for th corrsponing symols, this yils th floor sign pttrns s in Fig. 6. V. Conclusion n Discussion W hv consir hr grmmr systm tht involvs rgulr ruls s fin in th two-phs 2RLG n rry flt splicing ruls introuc in [23]. On coul lso consir in th flt splicing rry grmmr systm, CF horizontl ruls s in th two-phs two-imnsionl grmmr cll contxt-fr mtrix grmmr consir in [19], n xmin th gnrtiv powr of th rsulting systm, which might hlp scri mor complx floor signs. In fct it will of intrst to xplor th thorticl mol propos hr for othr possil pplictions in trms of xprimntl stuis. Acknowlgmnts Th uthors r grtful to th rviwrs for thir vry usful commnts. Rfrncs [1] Almn, L.M.: Molculr Computtion of Solutions to Comintoril Prolms, Scinc Nw Sris, 266(5187) (1994) [2] Brstl, J., Bosson, L., Fgnot, I. : Splicing systms n th Chomsky hirrchy. Thort. Comput. Sci. 436, 2-22 (2012).

8 343 Smnilthompson t l. [3] Csuhj-Vrjú, E., Dssow, J., Klmn, J., Păun, Gh.: Grmmr systms: A grmmticl pproch to istriution n cooprtion. Goron n Brch Scinc Pulishrs, [4] Dssow, J., Mitrn, V.: Splicing grmmr systms. Computrs n Artificil Intll. 15, (1996). [5] Esik, Z., Mrtin-Vi, C., Mitrn, V. (Es.): Rcnt Avncs in Forml Lngugs n Applictions, S- tuis in Computtioinl Intllignc, Springr-Vrlg, [6] Frun, R., Kri, L., Păun, Gh.,: DNA Computing Bs on Splicing: Th Existnc of Univrsl Computrs. Thory Comput. Syst. 32(1): (1999) [7] Gimmrrsi, D., Rstivo, A.: Two-imnsionl lngugs. In: [7], Vol. 3, pp (1997). [8] H, T.: Forml lngug thory n DNA: n nlysis of th gnrtiv cpcity of spcific rcominnt hviours. Bull. Mth. Biol. 49, (1987). [9] H, T., Circulr suggstions for DNA Computing, In: Pttrn Formtion in Biology, Vision n Dynmics(E. Cron, A. t l.), Worl Scintific, (2000) [10] H, T., Păun, Gh., Pixton, D. : Lngug thory n molculr gntics: gnrtiv mchnisms suggst y DNA rcomintion, In: [7], Vol. 2, pp , [11] H, T., Pixton, D.: Splicing n Rgulrity. Rcnt Avncs in Forml Lngugs n Applictions 2006: [12] Mrtin-Vi, C., Mitrn, V., Păun, Gh. (Es.): Forml Lngugs n Applictions. Springr-Vrlg, 2004 [13] Păun, Gh.: DNA computing s on splicing: univrslity rsults. Thor. Comput. Sci. 231(2): (2000) [14] Păun, Gh., Roznrg, G., Slom, A. : DNA Computing - Nw Computing Prigms. Txts in Thorticl Computr Scinc. An EATCS Sris, Springr [15] A. Rosnfl, Pictur Lngugs. Acmic Prss, Ring, MA, [16] A. Rosnfl, R. Siromony, Pictur lngugs survy, Lngugs of Dsign, 1 (1993) [17] Roznrg, G., Slom, A. (Es.): Hnook of Forml Lngugs Vol. 1 3, Springr, Brlin, (1997). [18] Surmnin, K.G., Smnilthompson, G., Dvi, N.G., Ngr, A.K. : Gnrting Pictur Arrys Bs on Grmmr Systms with Flt Splicing Oprtion,In: V. Snl t l. (s.), Innovtions in Bio-Inspir Computing n Applictions, Avncs in Intllignt Systms n Computing 424,Springr Intrntionl Pulishing Switzrln 2016, [19] Siromony, G., Siromony, R., Krithivsn, K. : Astrct fmilis of mtrics n pictur lngugs. Comput. Grph. Img. Procss. 1, (1972). [20] Siromony, R., Surmnin, K.G., Rngrjn, K. : Prlll/Squntil rctngulr rrys with tls. Int. J. Comput. Mth., 6A, (1977) [21] Surmnin, K.G., Ali, R.M., Gthlkshmi, M., Ngr, A.K. : Pur 2D pictur grmmrs n lngugs. Discrt Appl. Mth. 157 (2009) [22] Surmnin, K.G., Roslin Sgy Mry, A., Drsnmik, K.S. : Splicing Arry Grmmr Systms, Proc. Intrntionl Colloquium Thorticl Aspcts of Computing 2005, Lctur Nots in Computr Scinc 3722, Springr (2005). [23] Surmnin, K.G., Ngr, A.K., Pn, L. : A Pictur Arry Gnrting Mol Bs on Flt Splicing Oprtion, Proc. of th 10th Intrntionl Confrnc on Bioinspir Computing:Thoris n Applictions (BIC- TA), (2015). [24] Surmnin, K.G., Rngrjn, K., Mukun. M. (Es.): Forml Mols, Lngugs n Applictions. Sris in Mchin Prcption n Artificil Intll. Vol. 66, Worl Scintific Pulishing, Author Biogrphis G. Smilthompson ws orn on Mrch 13, H is pursuing his PhD progrmm from Jnury 2015 in th Dprtmnt of Mthmtics, Mrs Christin Collg, Ini with Prof. N. Gnnmlr Dvi s his suprvisor. H rciv his M.Phil gr in th yr His rsrch intrsts inclu DNA computing, pictur lngugs n grph lngugs. N. Gnnmlr Dvi ws orn on Dcmr 22, H hs n on th fculty of th Dprtmnt of Mthmtics, Mrs Christin Collg, Ini sinc 1980 n is currntly th H of this prtmnt. H ws th Dn of Scincs, Mrs Christin Collg uring th yrs H rciv his Ph.D. gr from th Univrsity of Mrs in H hs pulish numr of rsrch pprs in rput journls. His rsrch rs inclu grph grmmrs, pictur lngugs, DNA computing n stronomy. His - cmic visits inclu Univrsity of Brmn, Grmny n othr institutions in Frnc, Nthrlns n Grc. Atuly Ngr ws orn on Jnury 25, H is th Dn, Fculty of scinc, Livrpool Hop Univrsity, UK n lso hols th Fountion Chir s Profssor of Mthmticl Scincs in this univrsity. H rciv his Doctort (DPhil) in 1996 from th Univrsity of York. Prior to joining Livrpool Hop, h ws with th Dprtmnt of Mthmticl Scincs, n ltr t th Dprtmnt of Systms Enginring, t Brunl Univrsity, Lonon. Erlir h hs lctur t th Tt Institut of Funmntl Rsrch (TIFR), Bnglor, BITS Pilni n th Inin Institut of Tchnology (IITs) in Ini.

9 Flt Splicing Arry Grmmr Systms Gnrting Pictur Arrys 344 His rsrch is multi-isciplinry with xprtis in Nonlinr Mthmtics, Nturl Computing, Bio-Mthmtics n Computtionl Biology, Oprtions Rsrch, n Control Systms Enginring. H hs it volums on Intllignt Systms, n Appli Mthmtics. H is th Eitor-in- Chif of th Intrntionl Journl of Artificil Intllignc n Soft Computing (IJAISC) n srvs on itoril ors for numr of prstigious journls such s th Journl of Univrsl Computr scinc. H hs mor thn 200 pulictions in prstigious pulishing outlts n journls such s th Journl of Appli Mthmtics n Stochstic Anlysis, th Intrntionl Journl of Avncs in Enginring Scincs n Appli Mthmtics, th Intrntionl Journl of Fountions of Computr Scinc, th IEEE Trnsctions on Systms, Mn, n Cyrntics, Discrt Appli Mthmtics, Funmnt Informtic, IET Control Thory n Applictions n othrs. K.G. Surmnin ws orn on July 6, H rciv his PhD in 1980 from th Univrsity of Mrs, Ini. H ws on th fculty of th Dprtmnt of Mthmtics, Mrs Christin Collg, Chnni, Ini from 1970 to H hs srv s suprvisor for numr of PhD scholrs of Univrsity of Mrs. His min r of rsrch flls unr th ro topic of Mthmticl spcts of Computr Scinc n his rsrch intrsts inclu Comintorics on wors, pplictions of th thory of forml lngugs to pictur gnrtion, lrning n cryptogrphy n iologiclly motivt computing mols. H hs visit mny institutions in Frnc, Spin, Grmny, Vitnm, Chin, Mlysi, Jpn, UK on iffrnt prios for collortiv rsrch. H hs mny pulictions in rput journls. H ws visiting Profssor t th School of Mthmticl Scincs ( ) n th School of Computr Scincs ( ) t th Univrsiti Sins Mlysi, Mlysi. Currntly, h hs visiting profssor position t Livrpool Hop Univrsity, UK.

FSA. CmSc 365 Theory of Computation. Finite State Automata and Regular Expressions (Chapter 2, Section 2.3) ALPHABET operations: U, concatenation, *

FSA. CmSc 365 Theory of Computation. Finite State Automata and Regular Expressions (Chapter 2, Section 2.3) ALPHABET operations: U, concatenation, * CmSc 365 Thory of Computtion Finit Stt Automt nd Rgulr Exprssions (Chptr 2, Sction 2.3) ALPHABET oprtions: U, conctntion, * otin otin Strings Form Rgulr xprssions dscri Closd undr U, conctntion nd * (if

More information

CSE303 - Introduction to the Theory of Computing Sample Solutions for Exercises on Finite Automata

CSE303 - Introduction to the Theory of Computing Sample Solutions for Exercises on Finite Automata CSE303 - Introduction to th Thory of Computing Smpl Solutions for Exrciss on Finit Automt Exrcis 2.1.1 A dtrministic finit utomton M ccpts th mpty string (i.., L(M)) if nd only if its initil stt is finl

More information

Section 3: Antiderivatives of Formulas

Section 3: Antiderivatives of Formulas Chptr Th Intgrl Appli Clculus 96 Sction : Antirivtivs of Formuls Now w cn put th is of rs n ntirivtivs togthr to gt wy of vluting finit intgrls tht is ct n oftn sy. To vlut finit intgrl f(t) t, w cn fin

More information

Winter 2016 COMP-250: Introduction to Computer Science. Lecture 23, April 5, 2016

Winter 2016 COMP-250: Introduction to Computer Science. Lecture 23, April 5, 2016 Wintr 2016 COMP-250: Introduction to Computr Scinc Lctur 23, April 5, 2016 Commnt out input siz 2) Writ ny lgorithm tht runs in tim Θ(n 2 log 2 n) in wors cs. Explin why this is its running tim. I don

More information

Math 61 : Discrete Structures Final Exam Instructor: Ciprian Manolescu. You have 180 minutes.

Math 61 : Discrete Structures Final Exam Instructor: Ciprian Manolescu. You have 180 minutes. Nm: UCA ID Numr: Stion lttr: th 61 : Disrt Struturs Finl Exm Instrutor: Ciprin nolsu You hv 180 minuts. No ooks, nots or lultors r llow. Do not us your own srth ppr. 1. (2 points h) Tru/Fls: Cirl th right

More information

Last time: introduced our first computational model the DFA.

Last time: introduced our first computational model the DFA. Lctur 7 Homwork #7: 2.2.1, 2.2.2, 2.2.3 (hnd in c nd d), Misc: Givn: M, NFA Prov: (q,xy) * (p,y) iff (q,x) * (p,) (follow proof don in clss tody) Lst tim: introducd our first computtionl modl th DFA. Tody

More information

CSE 373: More on graphs; DFS and BFS. Michael Lee Wednesday, Feb 14, 2018

CSE 373: More on graphs; DFS and BFS. Michael Lee Wednesday, Feb 14, 2018 CSE 373: Mor on grphs; DFS n BFS Mihl L Wnsy, F 14, 2018 1 Wrmup Wrmup: Disuss with your nighor: Rmin your nighor: wht is simpl grph? Suppos w hv simpl, irt grph with x nos. Wht is th mximum numr of gs

More information

Walk Like a Mathematician Learning Task:

Walk Like a Mathematician Learning Task: Gori Dprtmnt of Euction Wlk Lik Mthmticin Lrnin Tsk: Mtrics llow us to prform mny usful mthmticl tsks which orinrily rquir lr numbr of computtions. Som typs of problms which cn b on fficintly with mtrics

More information

a b c cat CAT A B C Aa Bb Cc cat cat Lesson 1 (Part 1) Verbal lesson: Capital Letters Make The Same Sound Lesson 1 (Part 1) continued...

a b c cat CAT A B C Aa Bb Cc cat cat Lesson 1 (Part 1) Verbal lesson: Capital Letters Make The Same Sound Lesson 1 (Part 1) continued... Progrssiv Printing T.M. CPITLS g 4½+ Th sy, fun (n FR!) wy to tch cpitl lttrs. ook : C o - For Kinrgrtn or First Gr (not for pr-school). - Tchs tht cpitl lttrs mk th sm souns s th littl lttrs. - Tchs th

More information

Algorithmic and NP-Completeness Aspects of a Total Lict Domination Number of a Graph

Algorithmic and NP-Completeness Aspects of a Total Lict Domination Number of a Graph Intrntionl J.Mth. Comin. Vol.1(2014), 80-86 Algorithmi n NP-Compltnss Aspts of Totl Lit Domintion Numr of Grph Girish.V.R. (PES Institut of Thnology(South Cmpus), Bnglor, Krntk Stt, Ini) P.Ush (Dprtmnt

More information

Garnir Polynomial and their Properties

Garnir Polynomial and their Properties Univrsity of Cliforni, Dvis Dprtmnt of Mthmtis Grnir Polynomil n thir Proprtis Author: Yu Wng Suprvisor: Prof. Gorsky Eugny My 8, 07 Grnir Polynomil n thir Proprtis Yu Wng mil: uywng@uvis.u. In this ppr,

More information

Chem 104A, Fall 2016, Midterm 1 Key

Chem 104A, Fall 2016, Midterm 1 Key hm 104A, ll 2016, Mitrm 1 Ky 1) onstruct microstt tl for p 4 configurtion. Pls numrt th ms n ml for ch lctron in ch microstt in th tl. (Us th formt ml m s. Tht is spin -½ lctron in n s oritl woul writtn

More information

CSC Design and Analysis of Algorithms. Example: Change-Making Problem

CSC Design and Analysis of Algorithms. Example: Change-Making Problem CSC 801- Dsign n Anlysis of Algorithms Ltur 11 Gry Thniqu Exmpl: Chng-Mking Prolm Givn unlimit mounts of oins of nomintions 1 > > m, giv hng for mount n with th lst numr of oins Exmpl: 1 = 25, 2 =10, =

More information

1 Introduction to Modulo 7 Arithmetic

1 Introduction to Modulo 7 Arithmetic 1 Introution to Moulo 7 Arithmti Bor w try our hn t solvin som hr Moulr KnKns, lt s tk los look t on moulr rithmti, mo 7 rithmti. You ll s in this sminr tht rithmti moulo prim is quit irnt rom th ons w

More information

An undirected graph G = (V, E) V a set of vertices E a set of unordered edges (v,w) where v, w in V

An undirected graph G = (V, E) V a set of vertices E a set of unordered edges (v,w) where v, w in V Unirt Grphs An unirt grph G = (V, E) V st o vrtis E st o unorr gs (v,w) whr v, w in V USE: to mol symmtri rltionships twn ntitis vrtis v n w r jnt i thr is n g (v,w) [or (w,v)] th g (v,w) is inint upon

More information

Outline. 1 Introduction. 2 Min-Cost Spanning Trees. 4 Example

Outline. 1 Introduction. 2 Min-Cost Spanning Trees. 4 Example Outlin Computr Sin 33 Computtion o Minimum-Cost Spnnin Trs Prim's Alorithm Introution Mik Joson Dprtmnt o Computr Sin Univrsity o Clry Ltur #33 3 Alorithm Gnrl Constrution Mik Joson (Univrsity o Clry)

More information

ME 522 PRINCIPLES OF ROBOTICS. FIRST MIDTERM EXAMINATION April 19, M. Kemal Özgören

ME 522 PRINCIPLES OF ROBOTICS. FIRST MIDTERM EXAMINATION April 19, M. Kemal Özgören ME 522 PINCIPLES OF OBOTICS FIST MIDTEM EXAMINATION April 9, 202 Nm Lst Nm M. Kml Özgörn 2 4 60 40 40 0 80 250 USEFUL FOMULAS cos( ) cos cos sin sin sin( ) sin cos cos sin sin y/ r, cos x/ r, r 0 tn 2(

More information

More Foundations. Undirected Graphs. Degree. A Theorem. Graphs, Products, & Relations

More Foundations. Undirected Graphs. Degree. A Theorem. Graphs, Products, & Relations Mr Funtins Grphs, Pruts, & Rltins Unirt Grphs An unirt grph is pir f 1. A st f ns 2. A st f gs (whr n g is st f tw ns*) Friy, Sptmr 2, 2011 Ring: Sipsr 0.2 ginning f 0.4; Stughtn 1.1.5 ({,,,,}, {{,}, {,},

More information

V={A,B,C,D,E} E={ (A,D),(A,E),(B,D), (B,E),(C,D),(C,E)}

V={A,B,C,D,E} E={ (A,D),(A,E),(B,D), (B,E),(C,D),(C,E)} Introution Computr Sin & Enginring 423/823 Dsign n Anlysis of Algorithms Ltur 03 Elmntry Grph Algorithms (Chptr 22) Stphn Sott (Apt from Vinohnrn N. Vriym) I Grphs r strt t typs tht r pplil to numrous

More information

DFA (Deterministic Finite Automata) q a

DFA (Deterministic Finite Automata) q a Big pictur All lngugs Dcidl Turing mchins NP P Contxt-fr Contxt-fr grmmrs, push-down utomt Rgulr Automt, non-dtrministic utomt, rgulr xprssions DFA (Dtrministic Finit Automt) 0 q 0 0 0 0 q DFA (Dtrministic

More information

(2) If we multiplied a row of B by λ, then the value is also multiplied by λ(here lambda could be 0). namely

(2) If we multiplied a row of B by λ, then the value is also multiplied by λ(here lambda could be 0). namely . DETERMINANT.. Dtrminnt. Introution:I you think row vtor o mtrix s oorint o vtors in sp, thn th gomtri mning o th rnk o th mtrix is th imnsion o th prlllppi spnn y thm. But w r not only r out th imnsion,

More information

Graphs. CSC 1300 Discrete Structures Villanova University. Villanova CSC Dr Papalaskari

Graphs. CSC 1300 Discrete Structures Villanova University. Villanova CSC Dr Papalaskari Grphs CSC 1300 Disrt Struturs Villnov Univrsity Grphs Grphs r isrt struturs onsis?ng of vr?s n gs tht onnt ths vr?s. Grphs n us to mol: omputr systms/ntworks mthm?l rl?ons logi iruit lyout jos/prosss f

More information

The second condition says that a node α of the tree has exactly n children if the arity of its label is n.

The second condition says that a node α of the tree has exactly n children if the arity of its label is n. CS 6110 S14 Hanout 2 Proof of Conflunc 27 January 2014 In this supplmntary lctur w prov that th λ-calculus is conflunt. This is rsult is u to lonzo Church (1903 1995) an J. arkly Rossr (1907 1989) an is

More information

Graph Isomorphism. Graphs - II. Cayley s Formula. Planar Graphs. Outline. Is K 5 planar? The number of labeled trees on n nodes is n n-2

Graph Isomorphism. Graphs - II. Cayley s Formula. Planar Graphs. Outline. Is K 5 planar? The number of labeled trees on n nodes is n n-2 Grt Thortil Is In Computr Sin Vitor Amhik CS 15-251 Ltur 9 Grphs - II Crngi Mllon Univrsity Grph Isomorphism finition. Two simpl grphs G n H r isomorphi G H if thr is vrtx ijtion V H ->V G tht prsrvs jny

More information

0.1. Exercise 1: the distances between four points in a graph

0.1. Exercise 1: the distances between four points in a graph Mth 707 Spring 2017 (Drij Grinrg): mitrm 3 pg 1 Mth 707 Spring 2017 (Drij Grinrg): mitrm 3 u: W, 3 My 2017, in lss or y mil (grinr@umn.u) or lss S th wsit or rlvnt mtril. Rsults provn in th nots, or in

More information

V={A,B,C,D,E} E={ (A,D),(A,E),(B,D), (B,E),(C,D),(C,E)}

V={A,B,C,D,E} E={ (A,D),(A,E),(B,D), (B,E),(C,D),(C,E)} s s of s Computr Sin & Enginring 423/823 Dsign n Anlysis of Ltur 03 (Chptr 22) Stphn Sott (Apt from Vinohnrn N. Vriym) s of s s r strt t typs tht r pplil to numrous prolms Cn ptur ntitis, rltionships twn

More information

, each of which is a tree, and whose roots r 1. , respectively, are children of r. Data Structures & File Management

, each of which is a tree, and whose roots r 1. , respectively, are children of r. Data Structures & File Management nrl tr T is init st o on or mor nos suh tht thr is on sint no r, ll th root o T, n th rminin nos r prtition into n isjoint susts T, T,, T n, h o whih is tr, n whos roots r, r,, r n, rsptivly, r hilrn o

More information

Lecture 11 Waves in Periodic Potentials Today: Questions you should be able to address after today s lecture:

Lecture 11 Waves in Periodic Potentials Today: Questions you should be able to address after today s lecture: Lctur 11 Wvs in Priodic Potntils Tody: 1. Invrs lttic dfinition in 1D.. rphicl rprsnttion of priodic nd -priodic functions using th -xis nd invrs lttic vctors. 3. Sris solutions to th priodic potntil Hmiltonin

More information

Module graph.py. 1 Introduction. 2 Graph basics. 3 Module graph.py. 3.1 Objects. CS 231 Naomi Nishimura

Module graph.py. 1 Introduction. 2 Graph basics. 3 Module graph.py. 3.1 Objects. CS 231 Naomi Nishimura Moul grph.py CS 231 Nomi Nishimur 1 Introution Just lik th Python list n th Python itionry provi wys of storing, ssing, n moifying t, grph n viw s wy of storing, ssing, n moifying t. Bus Python os not

More information

COMPLEXITY OF COUNTING PLANAR TILINGS BY TWO BARS

COMPLEXITY OF COUNTING PLANAR TILINGS BY TWO BARS OMPLXITY O OUNTING PLNR TILINGS Y TWO RS KYL MYR strt. W show tht th prolm o trmining th numr o wys o tiling plnr igur with horizontl n vrtil r is #P-omplt. W uil o o th rsults o uquir, Nivt, Rmil, n Roson

More information

Notes on Finite Automata Department of Computer Science Professor Goldberg Textbooks: Introduction to the Theory of Computation by Michael Sipser

Notes on Finite Automata Department of Computer Science Professor Goldberg Textbooks: Introduction to the Theory of Computation by Michael Sipser Nots on Finit Automt Dprtmnt of Computr Scinc Profssor Goldrg Txtooks: Introduction to th Thory of Computtion y Michl Sipsr Elmnts of th Thory of Computtion y H. Lwis nd C. Ppdimitriou Ths nots contin

More information

Integration Continued. Integration by Parts Solving Definite Integrals: Area Under a Curve Improper Integrals

Integration Continued. Integration by Parts Solving Definite Integrals: Area Under a Curve Improper Integrals Intgrtion Continud Intgrtion y Prts Solving Dinit Intgrls: Ar Undr Curv Impropr Intgrls Intgrtion y Prts Prticulrly usul whn you r trying to tk th intgrl o som unction tht is th product o n lgric prssion

More information

Properties of Hexagonal Tile local and XYZ-local Series

Properties of Hexagonal Tile local and XYZ-local Series 1 Proprtis o Hxgonl Til lol n XYZ-lol Sris Jy Arhm 1, Anith P. 2, Drsnmik K. S. 3 1 Dprtmnt o Bsi Sin n Humnitis, Rjgiri Shool o Enginring n, Thnology, Kkkn, Ernkulm, Krl, Ini. jyjos1977@gmil.om 2 Dprtmnt

More information

Paths. Connectivity. Euler and Hamilton Paths. Planar graphs.

Paths. Connectivity. Euler and Hamilton Paths. Planar graphs. Pths.. Eulr n Hmilton Pths.. Pth D. A pth rom s to t is squn o gs {x 0, x 1 }, {x 1, x 2 },... {x n 1, x n }, whr x 0 = s, n x n = t. D. Th lngth o pth is th numr o gs in it. {, } {, } {, } {, } {, } {,

More information

TOPIC 5: INTEGRATION

TOPIC 5: INTEGRATION TOPIC 5: INTEGRATION. Th indfinit intgrl In mny rspcts, th oprtion of intgrtion tht w r studying hr is th invrs oprtion of drivtion. Dfinition.. Th function F is n ntidrivtiv (or primitiv) of th function

More information

Graphs. Graphs. Graphs: Basic Terminology. Directed Graphs. Dr Papalaskari 1

Graphs. Graphs. Graphs: Basic Terminology. Directed Graphs. Dr Papalaskari 1 CSC 00 Disrt Struturs : Introuon to Grph Thory Grphs Grphs CSC 00 Disrt Struturs Villnov Univrsity Grphs r isrt struturs onsisng o vrs n gs tht onnt ths vrs. Grphs n us to mol: omputr systms/ntworks mthml

More information

Using the Printable Sticker Function. Using the Edit Screen. Computer. Tablet. ScanNCutCanvas

Using the Printable Sticker Function. Using the Edit Screen. Computer. Tablet. ScanNCutCanvas SnNCutCnvs Using th Printl Stikr Funtion On-o--kin stikrs n sily rt y using your inkjt printr n th Dirt Cut untion o th SnNCut mhin. For inormtion on si oprtions o th SnNCutCnvs, rr to th Hlp. To viw th

More information

Outline. Computer Science 331. Computation of Min-Cost Spanning Trees. Costs of Spanning Trees in Weighted Graphs

Outline. Computer Science 331. Computation of Min-Cost Spanning Trees. Costs of Spanning Trees in Weighted Graphs Outlin Computr Sin 33 Computtion o Minimum-Cost Spnnin Trs Prim s Mik Joson Dprtmnt o Computr Sin Univrsity o Clry Ltur #34 Introution Min-Cost Spnnin Trs 3 Gnrl Constrution 4 5 Trmintion n Eiiny 6 Aitionl

More information

Why the Junction Tree Algorithm? The Junction Tree Algorithm. Clique Potential Representation. Overview. Chris Williams 1.

Why the Junction Tree Algorithm? The Junction Tree Algorithm. Clique Potential Representation. Overview. Chris Williams 1. Why th Juntion Tr lgorithm? Th Juntion Tr lgorithm hris Willims 1 Shool of Informtis, Univrsity of Einurgh Otor 2009 Th JT is gnrl-purpos lgorithm for omputing (onitionl) mrginls on grphs. It os this y

More information

Minimum Spanning Trees

Minimum Spanning Trees Minimum Spnning Trs Minimum Spnning Trs Problm A town hs st of houss nd st of rods A rod conncts nd only houss A rod conncting houss u nd v hs rpir cost w(u, v) Gol: Rpir nough (nd no mor) rods such tht:

More information

SOLVED EXAMPLES. be the foci of an ellipse with eccentricity e. For any point P on the ellipse, prove that. tan

SOLVED EXAMPLES. be the foci of an ellipse with eccentricity e. For any point P on the ellipse, prove that. tan LOCUS 58 SOLVED EXAMPLES Empl Lt F n F th foci of n llips with ccntricit. For n point P on th llips, prov tht tn PF F tn PF F Assum th llips to, n lt P th point (, sin ). P(, sin ) F F F = (-, 0) F = (,

More information

INTEGRALS. Chapter 7. d dx. 7.1 Overview Let d dx F (x) = f (x). Then, we write f ( x)

INTEGRALS. Chapter 7. d dx. 7.1 Overview Let d dx F (x) = f (x). Then, we write f ( x) Chptr 7 INTEGRALS 7. Ovrviw 7.. Lt d d F () f (). Thn, w writ f ( ) d F () + C. Ths intgrls r clld indfinit intgrls or gnrl intgrls, C is clld constnt of intgrtion. All ths intgrls diffr y constnt. 7..

More information

Similarity Search. The Binary Branch Distance. Nikolaus Augsten.

Similarity Search. The Binary Branch Distance. Nikolaus Augsten. Similrity Srh Th Binry Brnh Distn Nikolus Augstn nikolus.ugstn@sg..t Dpt. of Computr Sins Univrsity of Slzurg http://rsrh.uni-slzurg.t Vrsion Jnury 11, 2017 Wintrsmstr 2016/2017 Augstn (Univ. Slzurg) Similrity

More information

Instructions for Section 1

Instructions for Section 1 Instructions for Sction 1 Choos th rspons tht is corrct for th qustion. A corrct nswr scors 1, n incorrct nswr scors 0. Mrks will not b dductd for incorrct nswrs. You should ttmpt vry qustion. No mrks

More information

Linear Algebra Existence of the determinant. Expansion according to a row.

Linear Algebra Existence of the determinant. Expansion according to a row. Lir Algbr 2270 1 Existc of th dtrmit. Expsio ccordig to row. W dfi th dtrmit for 1 1 mtrics s dt([]) = (1) It is sy chck tht it stisfis D1)-D3). For y othr w dfi th dtrmit s follows. Assumig th dtrmit

More information

Chapter 16. 1) is a particular point on the graph of the function. 1. y, where x y 1

Chapter 16. 1) is a particular point on the graph of the function. 1. y, where x y 1 Prctic qustions W now tht th prmtr p is dirctl rltd to th mplitud; thrfor, w cn find tht p. cos d [ sin ] sin sin Not: Evn though ou might not now how to find th prmtr in prt, it is lws dvisl to procd

More information

# 1 ' 10 ' 100. Decimal point = 4 hundred. = 6 tens (or sixty) = 5 ones (or five) = 2 tenths. = 7 hundredths.

# 1 ' 10 ' 100. Decimal point = 4 hundred. = 6 tens (or sixty) = 5 ones (or five) = 2 tenths. = 7 hundredths. How os it work? Pl vlu o imls rprsnt prts o whol numr or ojt # 0 000 Tns o thousns # 000 # 00 Thousns Hunrs Tns Ons # 0 Diml point st iml pl: ' 0 # 0 on tnth n iml pl: ' 0 # 00 on hunrth r iml pl: ' 0

More information

12/3/12. Outline. Part 10. Graphs. Circuits. Euler paths/circuits. Euler s bridge problem (Bridges of Konigsberg Problem)

12/3/12. Outline. Part 10. Graphs. Circuits. Euler paths/circuits. Euler s bridge problem (Bridges of Konigsberg Problem) 12/3/12 Outlin Prt 10. Grphs CS 200 Algorithms n Dt Struturs Introution Trminology Implmnting Grphs Grph Trvrsls Topologil Sorting Shortst Pths Spnning Trs Minimum Spnning Trs Ciruits 1 Ciruits Cyl 2 Eulr

More information

Cycles and Simple Cycles. Paths and Simple Paths. Trees. Problem: There is No Completely Standard Terminology!

Cycles and Simple Cycles. Paths and Simple Paths. Trees. Problem: There is No Completely Standard Terminology! Outlin Computr Sin 331, Spnnin, n Surphs Mik Joson Dprtmnt o Computr Sin Univrsity o Clry Ltur #30 1 Introution 2 3 Dinition 4 Spnnin 5 6 Mik Joson (Univrsity o Clry) Computr Sin 331 Ltur #30 1 / 20 Mik

More information

5/9/13. Part 10. Graphs. Outline. Circuits. Introduction Terminology Implementing Graphs

5/9/13. Part 10. Graphs. Outline. Circuits. Introduction Terminology Implementing Graphs Prt 10. Grphs CS 200 Algorithms n Dt Struturs 1 Introution Trminology Implmnting Grphs Outlin Grph Trvrsls Topologil Sorting Shortst Pths Spnning Trs Minimum Spnning Trs Ciruits 2 Ciruits Cyl A spil yl

More information

CS September 2018

CS September 2018 Loil los Distriut Systms 06. Loil los Assin squn numrs to msss All ooprtin prosss n r on orr o vnts vs. physil los: rport tim o y Assum no ntrl tim sour Eh systm mintins its own lol lo No totl orrin o

More information

CSE 373: AVL trees. Warmup: Warmup. Interlude: Exploring the balance invariant. AVL Trees: Invariants. AVL tree invariants review

CSE 373: AVL trees. Warmup: Warmup. Interlude: Exploring the balance invariant. AVL Trees: Invariants. AVL tree invariants review rmup CSE 7: AVL trs rmup: ht is n invrint? Mihl L Friy, Jn 9, 0 ht r th AVL tr invrints, xtly? Disuss with your nighor. AVL Trs: Invrints Intrlu: Exploring th ln invrint Cor i: xtr invrint to BSTs tht

More information

b. How many ternary words of length 23 with eight 0 s, nine 1 s and six 2 s?

b. How many ternary words of length 23 with eight 0 s, nine 1 s and six 2 s? MATH 3012 Finl Exm, My 4, 2006, WTT Stunt Nm n ID Numr 1. All our prts o this prolm r onrn with trnry strings o lngth n, i.., wors o lngth n with lttrs rom th lpht {0, 1, 2}.. How mny trnry wors o lngth

More information

Exam 1 Solution. CS 542 Advanced Data Structures and Algorithms 2/14/2013

Exam 1 Solution. CS 542 Advanced Data Structures and Algorithms 2/14/2013 CS Avn Dt Struturs n Algorithms Exm Solution Jon Turnr //. ( points) Suppos you r givn grph G=(V,E) with g wights w() n minimum spnning tr T o G. Now, suppos nw g {u,v} is to G. Dsri (in wors) mtho or

More information

Constructive Geometric Constraint Solving

Constructive Geometric Constraint Solving Construtiv Gomtri Constrint Solving Antoni Soto i Rir Dprtmnt Llngutgs i Sistms Inormàtis Univrsitt Politèni Ctluny Brlon, Sptmr 2002 CGCS p.1/37 Prliminris CGCS p.2/37 Gomtri onstrint prolm C 2 D L BC

More information

Theoretical Study on the While Drilling Electromagnetic Signal Transmission of Horizontal Well

Theoretical Study on the While Drilling Electromagnetic Signal Transmission of Horizontal Well 7 nd ntrntionl Confrnc on Softwr, Multimdi nd Communiction Enginring (SMCE 7) SBN: 978--6595-458-5 Thorticl Study on th Whil Drilling Elctromgntic Signl Trnsmission of Horizontl Wll Y-huo FAN,,*, Zi-ping

More information

CS 461, Lecture 17. Today s Outline. Example Run

CS 461, Lecture 17. Today s Outline. Example Run Prim s Algorithm CS 461, Ltur 17 Jr Si Univrsity o Nw Mxio In Prim s lgorithm, th st A mintin y th lgorithm orms singl tr. Th tr strts rom n ritrry root vrtx n grows until it spns ll th vrtis in V At h

More information

COMP108 Algorithmic Foundations

COMP108 Algorithmic Foundations Grdy mthods Prudn Wong http://www.s.liv..uk/~pwong/thing/omp108/01617 Coin Chng Prolm Suppos w hv 3 typs of oins 10p 0p 50p Minimum numr of oins to mk 0.8, 1.0, 1.? Grdy mthod Lrning outoms Undrstnd wht

More information

CSE 373. Graphs 1: Concepts, Depth/Breadth-First Search reading: Weiss Ch. 9. slides created by Marty Stepp

CSE 373. Graphs 1: Concepts, Depth/Breadth-First Search reading: Weiss Ch. 9. slides created by Marty Stepp CSE 373 Grphs 1: Conpts, Dpth/Brth-First Srh ring: Wiss Ch. 9 slis rt y Mrty Stpp http://www.s.wshington.u/373/ Univrsity o Wshington, ll rights rsrv. 1 Wht is grph? 56 Tokyo Sttl Soul 128 16 30 181 140

More information

Outline. Circuits. Euler paths/circuits 4/25/12. Part 10. Graphs. Euler s bridge problem (Bridges of Konigsberg Problem)

Outline. Circuits. Euler paths/circuits 4/25/12. Part 10. Graphs. Euler s bridge problem (Bridges of Konigsberg Problem) 4/25/12 Outlin Prt 10. Grphs CS 200 Algorithms n Dt Struturs Introution Trminology Implmnting Grphs Grph Trvrsls Topologil Sorting Shortst Pths Spnning Trs Minimum Spnning Trs Ciruits 1 2 Eulr s rig prolm

More information

Designing A Concrete Arch Bridge

Designing A Concrete Arch Bridge This is th mous Shwnh ri in Switzrln, sin y Rort Millrt in 1933. It spns 37.4 mtrs (122 t) n ws sin usin th sm rphil mths tht will monstrt in this lsson. To pro with this lsson, lik on th Nxt utton hr

More information

Present state Next state Q + M N

Present state Next state Q + M N Qustion 1. An M-N lip-lop works s ollows: I MN=00, th nxt stt o th lip lop is 0. I MN=01, th nxt stt o th lip-lop is th sm s th prsnt stt I MN=10, th nxt stt o th lip-lop is th omplmnt o th prsnt stt I

More information

Seven-Segment Display Driver

Seven-Segment Display Driver 7-Smnt Disply Drivr, Ron s in 7-Smnt Disply Drivr, Ron s in Prolm 62. 00 0 0 00 0000 000 00 000 0 000 00 0 00 00 0 0 0 000 00 0 00 BCD Diits in inry Dsin Drivr Loi 4 inputs, 7 outputs 7 mps, h with 6 on

More information

Finite Automata. d: Q S Q. Finite automaton is M=(Q, S, d, q 0, F) Ex: an FA that accepts all odd-length strings of zeros: q 0 q 1. q i. q k.

Finite Automata. d: Q S Q. Finite automaton is M=(Q, S, d, q 0, F) Ex: an FA that accepts all odd-length strings of zeros: q 0 q 1. q i. q k. Finit Automt Bsic id: FA is mchin tht chngs stts whil procssing symols, on t tim. Finit st of stts: Q = {q 0, q 1, q 3,..., q k } Trnsition function: Initil stt: Finl stts: d: Q S Q q 0 Q F Q Finit utomton

More information

A 4-state solution to the Firing Squad Synchronization Problem based on hybrid rule 60 and 102 cellular automata

A 4-state solution to the Firing Squad Synchronization Problem based on hybrid rule 60 and 102 cellular automata A 4-stt solution to th Firing Squ Synhroniztion Prolm s on hyri rul 60 n 102 llulr utomt LI Ning 1, LIANG Shi-li 1*, CUI Shung 1, XU Mi-ling 1, ZHANG Ling 2 (1. Dprtmnt o Physis, Northst Norml Univrsity,

More information

QUESTIONS BEGIN HERE!

QUESTIONS BEGIN HERE! Points miss: Stunt's Nm: Totl sor: /100 points Est Tnnss Stt Univrsity Dprtmnt of Computr n Informtion Sins CSCI 710 (Trnoff) Disrt Struturs TEST for Fll Smstr, 00 R this for strtin! This tst is los ook

More information

Coalgebra, Lecture 15: Equations for Deterministic Automata

Coalgebra, Lecture 15: Equations for Deterministic Automata Colger, Lecture 15: Equtions for Deterministic Automt Julin Slmnc (nd Jurrin Rot) Decemer 19, 2016 In this lecture, we will study the concept of equtions for deterministic utomt. The notes re self contined

More information

Nefertiti. Echoes of. Regal components evoke visions of the past MULTIPLE STITCHES. designed by Helena Tang-Lim

Nefertiti. Echoes of. Regal components evoke visions of the past MULTIPLE STITCHES. designed by Helena Tang-Lim MULTIPLE STITCHES Nrtiti Ehos o Rgl omponnts vok visions o th pst sign y Hln Tng-Lim Us vrity o stiths to rt this rgl yt wrl sign. Prt sping llows squr s to mk roun omponnts tht rp utiully. FCT-SC-030617-07

More information

A Simple Code Generator. Code generation Algorithm. Register and Address Descriptors. Example 3/31/2008. Code Generation

A Simple Code Generator. Code generation Algorithm. Register and Address Descriptors. Example 3/31/2008. Code Generation A Simpl Co Gnrtor Co Gnrtion Chptr 8 II Gnrt o for singl si lok How to us rgistrs? In most mhin rhitturs, som or ll of th oprnsmust in rgistrs Rgistrs mk goo tmporris Hol vlus tht r omput in on si lok

More information

CIVL 8/ D Boundary Value Problems - Rectangular Elements 1/7

CIVL 8/ D Boundary Value Problems - Rectangular Elements 1/7 CIVL / -D Boundr Vlu Prolms - Rctngulr Elmnts / RECANGULAR ELEMENS - In som pplictions, it m mor dsirl to us n lmntl rprsnttion of th domin tht hs four sids, ithr rctngulr or qudriltrl in shp. Considr

More information

Multi-Section Coupled Line Couplers

Multi-Section Coupled Line Couplers /0/009 MultiSction Coupld Lin Couplrs /8 Multi-Sction Coupld Lin Couplrs W cn dd multipl coupld lins in sris to incrs couplr ndwidth. Figur 7.5 (p. 6) An N-sction coupld lin l W typiclly dsign th couplr

More information

CS200: Graphs. Graphs. Directed Graphs. Graphs/Networks Around Us. What can this represent? Sometimes we want to represent directionality:

CS200: Graphs. Graphs. Directed Graphs. Graphs/Networks Around Us. What can this represent? Sometimes we want to represent directionality: CS2: Grphs Prihr Ch. 4 Rosn Ch. Grphs A olltion of nos n gs Wht n this rprsnt? n A omputr ntwork n Astrtion of mp n Soil ntwork CS2 - Hsh Tls 2 Dirt Grphs Grphs/Ntworks Aroun Us A olltion of nos n irt

More information

DUET WITH DIAMONDS COLOR SHIFTING BRACELET By Leslie Rogalski

DUET WITH DIAMONDS COLOR SHIFTING BRACELET By Leslie Rogalski Dut with Dimons Brlt DUET WITH DIAMONDS COLOR SHIFTING BRACELET By Lsli Roglski Photo y Anrw Wirth Supruo DUETS TM from BSmith rt olor shifting fft tht mks your work tk on lif of its own s you mov! This

More information

12. Traffic engineering

12. Traffic engineering lt2.ppt S-38. Introution to Tltrffi Thory Spring 200 2 Topology Pths A tlommunition ntwork onsists of nos n links Lt N not th st of nos in with n Lt J not th st of nos in with j N = {,,,,} J = {,2,3,,2}

More information

Research Article A Novel Approach toward Fuzzy Generalized Bi-Ideals in Ordered Semigroups

Research Article A Novel Approach toward Fuzzy Generalized Bi-Ideals in Ordered Semigroups Scintific Worl Journl, Articl ID 275947, 9 pgs http://x.oi.org/1.1155/214/275947 Rsrch Articl A Novl Approch towr Fuzzy Gnrliz Bi-Ils in Orr Smigroups Fiz Muhmm Khn, 1 Nor Hniz Srmin, 2 n Hiyt Ullh Khn

More information

CS61B Lecture #33. Administrivia: Autograder will run this evening. Today s Readings: Graph Structures: DSIJ, Chapter 12

CS61B Lecture #33. Administrivia: Autograder will run this evening. Today s Readings: Graph Structures: DSIJ, Chapter 12 Aministrivi: CS61B Ltur #33 Autogrr will run this vning. Toy s Rings: Grph Struturs: DSIJ, Chptr 12 Lst moifi: W Nov 8 00:39:28 2017 CS61B: Ltur #33 1 Why Grphs? For xprssing non-hirrhilly rlt itms Exmpls:

More information

Numbering Boundary Nodes

Numbering Boundary Nodes Numring Bounry Nos Lh MBri Empori Stt Univrsity August 10, 2001 1 Introution Th purpos of this ppr is to xplor how numring ltril rsistor ntworks ffts thir rspons mtrix, Λ. Morovr, wht n lrn from Λ out

More information

Formal Concept Analysis

Formal Concept Analysis Forml Conpt Anlysis Conpt intnts s losd sts Closur Systms nd Implitions 4 Closur Systms 0.06.005 Nxt-Closur ws dvlopd y B. Gntr (984). Lt M = {,..., n}. A M is ltilly smllr thn B M, if B A if th smllst

More information

ECE COMBINATIONAL BUILDING BLOCKS - INVEST 13 DECODERS AND ENCODERS

ECE COMBINATIONAL BUILDING BLOCKS - INVEST 13 DECODERS AND ENCODERS C 24 - COMBINATIONAL BUILDING BLOCKS - INVST 3 DCODS AND NCODS FALL 23 AP FLZ To o "wll" on this invstition you must not only t th riht nswrs ut must lso o nt, omplt n onis writups tht mk ovious wht h

More information

S i m p l i f y i n g A l g e b r a SIMPLIFYING ALGEBRA.

S i m p l i f y i n g A l g e b r a SIMPLIFYING ALGEBRA. S i m p l i y i n g A l g r SIMPLIFYING ALGEBRA www.mthltis.o.nz Simpliying SIMPLIFYING Algr ALGEBRA Algr is mthmtis with mor thn just numrs. Numrs hv ix vlu, ut lgr introus vrils whos vlus n hng. Ths

More information

Sticker Systems over Permutation Groups

Sticker Systems over Permutation Groups World Applied Sciences Journl 1 (Specil Issue of Applied Mth): 119-16, 01 ISSN 1818-495; IDOSI Pulictions, 01 DOI: 10.589/idosi.wsj.01.1.m.11 Sticker Systems over Permuttion Groups 1 N.A. Mohd Sery, N.H.

More information

cycle that does not cross any edges (including its own), then it has at least

cycle that does not cross any edges (including its own), then it has at least W prov th following thorm: Thorm If a K n is drawn in th plan in such a way that it has a hamiltonian cycl that dos not cross any dgs (including its own, thn it has at last n ( 4 48 π + O(n crossings Th

More information

The Course covers: Lexical Analysis Syntax Analysis Semantic Analysis Runtime environments Code Generation Code Optimization. CS 540 Spring 2013 GMU 2

The Course covers: Lexical Analysis Syntax Analysis Semantic Analysis Runtime environments Code Generation Code Optimization. CS 540 Spring 2013 GMU 2 CS 540 Spring 2013 Th Cours covrs: Lxicl Anlysis Syntx Anlysis Smntic Anlysis Runtim nvironmnts Cod Gnrtion Cod Optimiztion CS 540 Spring 2013 GMU 2 Pr-rquisit courss Strong progrmming ckground in C, C++

More information

Parse trees, ambiguity, and Chomsky normal form

Parse trees, ambiguity, and Chomsky normal form Prse trees, miguity, nd Chomsky norml form In this lecture we will discuss few importnt notions connected with contextfree grmmrs, including prse trees, miguity, nd specil form for context-free grmmrs

More information

CONIC SECTIONS. MODULE-IV Co-ordinate Geometry OBJECTIVES. Conic Sections

CONIC SECTIONS. MODULE-IV Co-ordinate Geometry OBJECTIVES. Conic Sections Conic Sctions 16 MODULE-IV Co-ordint CONIC SECTIONS Whil cutting crrot ou might hv noticd diffrnt shps shown th dgs of th cut. Anlticll ou m cut it in thr diffrnt ws, nml (i) (ii) (iii) Cut is prlll to

More information

On the Role of Fitness, Precision, Generalization and Simplicity in Process Discovery

On the Role of Fitness, Precision, Generalization and Simplicity in Process Discovery On th Rol of Fitnss, Prcision, Gnrliztion n Simplicity in Procss Discovry Joos Buijs Bouwijn vn Dongn Wil vn r Alst http://www.win.tu.nl/coslog/ Avncs in Procss ining ny procss iscovry n conformnc chcking

More information

2-D ARMA MODEL PARAMETER ESTIMATION BASED ON THE EQUIVALENT 2-D AR MODEL APPROACH

2-D ARMA MODEL PARAMETER ESTIMATION BASED ON THE EQUIVALENT 2-D AR MODEL APPROACH -D AMA MODEL PAAMETE ESTIMATION BASED ON THE EQUIVALENT -D A MODEL APPOAH Ayın Kıılky Ahmt Hmi Kyrn -mil: yin@hituutr -mil: kyrn@hituutr Istnul Tchnicl Univrsity, Fculty of Elctricl n Elctronics Enginring,

More information

Polygons POLYGONS.

Polygons POLYGONS. Polgons PLYGNS www.mthltis.o.uk ow os it work? Solutions Polgons Pg qustions Polgons Polgon Not polgon Polgon Not polgon Polgon Not polgon Polgon Not polgon f g h Polgon Not polgon Polgon Not polgon Polgon

More information

Construction of asymmetric orthogonal arrays of strength three via a replacement method

Construction of asymmetric orthogonal arrays of strength three via a replacement method isid/ms/26/2 Fbruary, 26 http://www.isid.ac.in/ statmath/indx.php?modul=prprint Construction of asymmtric orthogonal arrays of strngth thr via a rplacmnt mthod Tian-fang Zhang, Qiaoling Dng and Alok Dy

More information

Weighted graphs -- reminder. Data Structures LECTURE 15. Shortest paths algorithms. Example: weighted graph. Two basic properties of shortest paths

Weighted graphs -- reminder. Data Structures LECTURE 15. Shortest paths algorithms. Example: weighted graph. Two basic properties of shortest paths Dt Strutur LECTURE Shortt pth lgorithm Proprti of hortt pth Bllmn-For lgorithm Dijktr lgorithm Chptr in th txtook (pp ). Wight grph -- rminr A wight grph i grph in whih g hv wight (ot) w(v i, v j ) >.

More information

, between the vertical lines x a and x b. Given a demand curve, having price as a function of quantity, p f (x) at height k is the curve f ( x,

, between the vertical lines x a and x b. Given a demand curve, having price as a function of quantity, p f (x) at height k is the curve f ( x, Clculus for Businss nd Socil Scincs - Prof D Yun Finl Em Rviw vrsion 5/9/7 Chck wbsit for ny postd typos nd updts Pls rport ny typos This rviw sht contins summris of nw topics only (This rviw sht dos hv

More information

1 Finite Automata and Regular Expressions

1 Finite Automata and Regular Expressions 1 Fini Auom nd Rgulr Exprion Moivion: Givn prn (rgulr xprion) for ring rching, w migh wn o convr i ino drminiic fini uomon or nondrminiic fini uomon o mk ring rching mor fficin; drminiic uomon only h o

More information

(Upside-Down o Direct Rotation) β - Numbers

(Upside-Down o Direct Rotation) β - Numbers Amrican Journal of Mathmatics and Statistics 014, 4(): 58-64 DOI: 10593/jajms0140400 (Upsid-Down o Dirct Rotation) β - Numbrs Ammar Sddiq Mahmood 1, Shukriyah Sabir Ali,* 1 Dpartmnt of Mathmatics, Collg

More information

The Theory of Small Reflections

The Theory of Small Reflections Jim Stils Th Univ. of Knss Dt. of EECS 4//9 Th Thory of Smll Rflctions /9 Th Thory of Smll Rflctions Rcll tht w nlyzd qurtr-wv trnsformr usg th multil rflction viw ot. V ( z) = + β ( z + ) V ( z) = = R

More information

Multipoint Alternate Marking method for passive and hybrid performance monitoring

Multipoint Alternate Marking method for passive and hybrid performance monitoring Multipoint Altrnt Mrkin mtho or pssiv n hyri prormn monitorin rt-iool-ippm-multipoint-lt-mrk-00 Pru, Jul 2017, IETF 99 Giuspp Fiool (Tlom Itli) Muro Coilio (Tlom Itli) Amo Spio (Politnio i Torino) Riro

More information

Problem solving by search

Problem solving by search Prolm solving y srh Tomáš voo Dprtmnt o Cyrntis, Vision or Roots n Autonomous ystms Mrh 5, 208 / 3 Outlin rh prolm. tt sp grphs. rh trs. trtgis, whih tr rnhs to hoos? trtgy/algorithm proprtis? Progrmming

More information

WORKSHOP 6 BRIDGE TRUSS

WORKSHOP 6 BRIDGE TRUSS WORKSHOP 6 BRIDGE TRUSS WS6-2 Workshop Ojtivs Lrn to msh lin gomtry to gnrt CBAR lmnts Bom fmilir with stting up th CBAR orinttion vtor n stion proprtis Lrn to st up multipl lo ss Lrn to viw th iffrnt

More information

Ch 1.2: Solutions of Some Differential Equations

Ch 1.2: Solutions of Some Differential Equations Ch 1.2: Solutions of Som Diffrntil Equtions Rcll th fr fll nd owl/mic diffrntil qutions: v 9.8.2v, p.5 p 45 Ths qutions hv th gnrl form y' = y - b W cn us mthods of clculus to solv diffrntil qutions of

More information

Enforcement of Opacity Security Properties Using Insertion Functions

Enforcement of Opacity Security Properties Using Insertion Functions Enforcmnt of Opcity Scurity Proprtis Using Insrtion Functions Yi-Chin Wu nd Stéphn Lfortun EECS Dprtmnt, Univrsity of Michign CDC 12 Dc. 13 th, 2012 Motivtion Scurity nd privcy concrns in onlin srvics

More information

EE1000 Project 4 Digital Volt Meter

EE1000 Project 4 Digital Volt Meter Ovrviw EE1000 Projt 4 Diitl Volt Mtr In this projt, w mk vi tht n msur volts in th rn o 0 to 4 Volts with on iit o ury. Th input is n nlo volt n th output is sinl 7-smnt iit tht tlls us wht tht input s

More information