Dense Coding, Teleportation, No Cloning

Size: px
Start display at page:

Download "Dense Coding, Teleportation, No Cloning"

Transcription

1 qitd352 Dense Coding, Teleporttion, No Cloning Roert B. Griffiths Version of 8 Ferury 2012 Referenes: NLQI = R. B. Griffiths, Nture nd lotion of quntum informtion Phys. Rev. A 66 (2002) ; QCQI = Quntum Computtion nd Quntum Informtion y Nielsen nd Chung (Cmridge, 2000). Look up superdense oding, teleporttion, no-loning in the index. Add p. 187 to the teleporttion referenes. Contents 1 Fully Entngled Sttes 1 2 Dense Coding 2 3 Teleporttion 4 4 No Cloning 7 1 Fully Entngled Sttes As previously noted, entngled sttes on tensor produt re peulirly quntum in the sense tht there is no good lssil nlog for them. Dense oding nd teleporttion re two proesses whih mke use of entngled sttes, nd for this reson pper somewht strnge from n everydy lssil perspetive. We shll lter introdue mesure of entnglement for pure sttes, ut for the moment ll we need re fully entngled (or mximlly entngled) sttes. Let nd e two ilert spes of the sme dimension d = d = d. Any stte on Ψ on = n e written in the Shmidt form: = j λ j j j, (1) where { j } nd { k } re suitle orthonorml ses (whih depend upon ). A fully entngled stte is one for whih ll the λ re equl (or equl in mgnitude if one does not impose the ondition λ j > 0), nd thus equl to 1/ d if is normlized. In the se of two quits, d = 2, the Bell sttes B 0 = ( ) / 2, B 1 = ( ) / 2, B 2 = ( ) / 2, B 3 = ( ) / 2, (2) re exmples of fully-entngled sttes whih form n orthonorml sis. Fully entngled sttes n lso e hrterized in the following wy. Let the redued density opertors for normlized on nd e defined in the usul wy: ρ = Tr ([ψ]), ρ = Tr ([ψ]). (3) For fully entngled stte, ρ = I/d = ρ. (4) 1

2 Note tht we re ssuming tht the redued density mtries ome from pure stte on, nd not from mixed stte represented y density opertor. (Entnglement for mixed sttes is omplex prolem whih is fr from well understood t the present time.) Exerise. Show tht only one of the equlities in (4) is tully needed, s the seond is onsequene of the first (nd vie vers). Fully entngled sttes do not hve unique Shmidt deomposition. Given ny orthonorml sis { j } of, there is n orthonorml sis { k } of, one tht depends oth on { j } nd on, suh tht (1) holds (with λ j = 1/ d). Exerise. Prove this ssertion y expnding in the form j j β j, nd using (4). Given two normlized fully entngled sttes nd φ on one n lwys find unitry opertors U nd V on nd suh tht φ = (U V ). (5) Tht there is some unitry opertor W on mpping to φ is onsequene of the ft tht they hve the sme norm. Wht is speil out (5) is tht W is of the form U V. It will e onvenient to refer to ll suh n opertor lol unitry. The ide of lol is tht one thinks of the susystems nd s loted in two seprte lortories where Alie pplies U to the first nd Bo pplies V to the seond system. Exerise. Another lss of pure sttes mpped into eh other y lol unitries re the (normlized) produt sttes. Cn you think of other lsses? Wht is the most generl lss? [int: Shmidt.] For ny d = d = d 2 one n find n orthonorml sis for onsisting of fully entngled sttes, nlogous to the Bell sis in (2). These ses re not unique, there re lwys mny possiilities. If the dimensions d nd d re unequl, one nnot hve fully entngled stte of the form defined ove, euse the numer of nonzero Shmidt oeffiients n t most e the smller of d nd d. owever, one n hve mximlly entngled stte where, for exmple, if d < d, then d of the Shmidt oeffiients re equl to eh other (or equl in mgnitude). Sometimes it is helpful to define uniformly entngled stte s one in whih ll the nonzero Shmidt oeffiients re equl (or of the sme mgnitude). 2 Dense Coding The phenomenon of dense oding is sed on the oservtion tht given some stte elonging to the Bell sis (2) there re lol unitries on whih will mp it onto ny of the other sttes elonging to the sis, prt from n overll phse. There re similr unitries on. Thus if we strt with B 0, it is mpped to B 1 y X I, to B 2 y Z I, nd to B 3 (up to phse) y Y I. As onsequene, given n entngled stte B j shred etween Alie s nd Bo s lortories, either one of them n onvert it into nother sis stte B k y pplying n pproprite unitry. On the other hnd, neither of them n determine y lol mesurements, i.e., entirely y mesurements on, or entirely y mesurements on, whih B j they jointly possess. Exerise. Disuss why this is so. [int. Suppose Alie rries out mesurements in some orthonorml sis of. Wht will e the proilities of the outomes?] If they oth rry out mesurements nd ompre them using lssil hnnel (telephone) they n mke some distintions. For exmple, mesurements in the stndrd sis when ompred with eh other will distinguish B 0 from B 1 nd B 3, ut not from B 2. To rry out mesurement in the Bell sis requires either ringing the quits together, or else doing something like teleporttion, whih requires nother quit pir in known Bell (or other fully entngled) stte. A onvenient wy of imgining how one of the B j might e shred y Alie nd Bo is to suppose tht Bo produes it in some system in his lortory (e.g., y photon down onversion), nd then ships the prt to Alie over perfet quntum hnnel. Putting inside refully onstruted ox 2

3 so tht it will not e distured, nd sending the ox to Alie y prel servie, is to e thought of s quntum hnnel though not very prtil one, given urrent tehnology. It is more relisti to imgine n optil fier etween the lortories, nd sending one of two down-onverted photons through the fier. The protool for dense oding is illustrted in the following figure, whih shows quntum iruit with prts in Alie s (upstirs) nd Bo s (sement) lortories. ā ā ā ā Alie Z Bo ā t 0 t 1 t 2 t 3 t 4 t 5 t 6 t 7 t 8 Figure 1: Ciruit for dense oding. The prt of the iruit preeding t 2 is simply devie to turn the produt stte 00 of two quits nd in Bo s lortory into the entngled Bell stte B 0. The quit is then shipped upstirs to Alie. (Alterntively, Alie ould produe the entngled pir in her lortory nd ship downstirs to Bo.) Alie then rries out one of four unitry opertions on quit whih either leve the omintion in B 0 or mp it into one of the B j with j > 0. Wheres one ould imgine Alie doing this y hnd, the figure shows quntum iruit in whih the unitry is ontrolled y two quits nd ā, whih re initilly in one of the four stndrd sis sttes 00, 01, 10, 11 orresponding to the four possile messges whih Alie n trnsmit to Bo y this mens. At t 5 quit is shipped k to Bo. The iruit in his l following t 6 is just the mirror imge of the one used to produe B 0 in the first ple, nd its purpose is to mesure whih Bell stte the pir is in. The result of the mesurement will e two quits whose sttes, s indited in the digrm, re the sme s Alie s input, ssuming lwys tht oth nd ā re initilly either or 1. Exerise. Wht hppens if one hooses initil = x + = + nd initil ā =? Wht stte results t t 8 from unitry time evolution? Suppose t this time the four quits re mesured in the stndrd sis; wht will one find? Wht mkes this proess seem prdoxil, nd gives rise to the nme dense oding, is the ft tht only one quit,, psses from Alie s lortory to Bo s during the time intervl etween Alie s preprtion nd Bo s mesurement. On the other hnd, two its of informtion needed to identify one out of four possile messges hve somehow pssed etween them. To put it nother wy, if there were only one it lssil hnnel etween Alie nd Bo, it would hve to e used twie to get the messge through, wheres the quntum hnnel is only used one, t lest if we ignore wht hppened efore t 3. In summry, it looks s if single quit n rry two its of lssil informtion! But loser inspetion shows tht things re not quite so simple. Let us imgine, for exmple, tht quit ws ptured y some outsider (trditionlly know s n evesdropper, or Eve) who wnted to listen in on the messge etween Alie nd Bo. Wht ould she lern out the vlues of nd ā from mesuring or rrying out other opertions on? Asolutely nothing. From this point of view one might rgue tht rther 3

4 thn two its of informtion, quit ontins no informtion (of the relevnt sort) t ll! In the sme wy one n show tht quit y itself ontins no informtion out nd ā efore t 6 when the mesurement ours. Thus in some sense it is only the omined system of long with tht ontins or rries the informtion; one n sy tht the informtion resides in orreltions etween these quits. Exerise. Show tht no informtion is present in either quit or quit seprtely t the time t 5, y omputing the redued density opertor of eh quit nd showing tht it is independent of nd ā. Some insight into wht is going on is provided y the following nlogy. Imgine tht the quntum hnnel etween Alie nd Bo is repled y lssil hnnel, whih I like to think of s pipe whih n rry olored slips of pper. In the sement Bo hs mhine whih puts out two slips of pper of the sme olor, red(r) or green (G) in rndom fshion, suh tht RR or GG is produed with proility 1/2. The first slip is sent upstirs to Alie, who sends messge k to Bo in the following fshion. For 0, she returns slip with the sme olor, nd for 1 she returns slip with the opposite olor (G if she reeived R, R if she reeived G). Bo reds the messge y ompring the olor of the slip in his possession with the one sent k y Alie: if they re the sme tht signifies 0, if they re different tht mens 1. The min point of this nlogy is tht it shows how the messge is stored in orreltions rther thn in individul slips of pper. If Eve stels the slip whih Alie is sending k to Bo, she will lern nothing out the messge, for the proility tht it will e red or green is 1/2, independent of whtever messge Alie deided to send. There is tully loser onnetion etween this nlogy nd the quntum iruit in Fig. 1 thn one might t first suppose; there is wy of desriing the quntum proess using prtiulr onsistent fmily of histories whih mkes it look lmost like the lssil sitution just desried. (Detils re given in Se. V of NLQI.) owever, in the lssil se Alie n only send one it of informtion per slip of pper, wheres in the quntum se she n send two its per quit, so there is still quntum mystery. One wy of viewing the mystery is to rell tht, Se. 1, the Bell sis hs the property tht given n initil stte is one of the Bell sis sttes, Alie herself, with no help from Bo, n trnsform it to ny one of the other three sis sttes. Contrst this with wht hppens when one uses sis of produt sttes suh s the stndrd sis 00, 01, 10, 11. ere it is ovious tht there is no wy y whih Alie y herself n hnge 00 (for exmple) into eh of the other sis sttes. She n only reh one other sis stte, not ll three. Consequently, Alie n put two its of informtion into the two quit system if it strts off in fully-entngled stte, ut only one it of informtion if it strts off in produt stte. The ltter is wht orresponds est with our lssil experiene of the world, nd tht is one reson we find quntum entnglement peulir nd perplexing. Dense oding n e generlized in n ovious wy to systems with d > 2. A totl of d 2 different messges n e sent through d-dimensionl quntum hnnel, provided Alie nd Bo shre fullyentngled stte to egin with. 3 Teleporttion Teleporttion resemles dense oding in tht it requires the presene of fully entngled stte t the outset. owever, its gol is silly different: rther thn send lrger-thn-expeted mount of lssil informtion over quntum hnnel, the ide is to send quntum stte over lssil hnnel. Figure 10.2 shows the si rrngement for teleporttion in the form of iruit. As in Fig. 1, the elements preeding t 2 rete n entngled stte B 0 on quits nd, nd the quit is sent to Alie s l over quntum hnnel. Next Crol rings to Alie stte to e teleported to Crol s ssoite Chrlie, who is witing in Bo s lortory. The iruit in Alie s lortory etween t 3 nd t 5 followed y the stndrd-sis detetors D nd D serves to mesure the system onsisting of quits nd in the Bell sis. Note tht this is silly the sme rrngement s one finds in Fig. 1 following t 6 (where the detetors re not shown) nd its purpose is the sme. 4

5 D Alie D Bo Z t 0 t 1 t 2 t 3 t 4 t 5 t 6 t 7 t 8 Figure 2: Teleporttion. The outomes of the mesurements re lssil signls, shown s hevy lines, whih n e trnsmitted to Bo over lssil hnnel, for exmple, n ordinry phone line. At this point Bo rries out unitry trnsformtion on quit, the nture of whih is determined y the messge reeived from Alie. The figure shows n utomted version: if D = 1, n X or not opertion is performed on, nd if D = 1 Z or phse opertion is performed on, wheres if D or D is 0 the orresponding opertion is not rried out. The net result is tht fter these opertions quit, whih Bo hnds to Chrlie, is in the sme stte s the quit whih Crol rought to Alie. This is the sense in whih the quntum stte hs een teleported with the help of two lssil its of informtion, the outomes of the D nd D mesurements, nd without the need for rel quntum hnnel from Alie to Bo. Things re, of ourse, not quite tht simple, for quntum hnnel ws needed to set up the entngled stte essentil for teleporttion. owever, this ws used erlier, possily even efore Crol reted the stte to ring to Alie. One n well imgine tht even if good quntum hnnel were ville to Bo nd Alie, it might e dvntgeous to employ it to produe olletion of pirs of entngled quits on weekends when the rtes re low, nd then teleport using lssil hnnel during the week. Or, teleporttion might e reserved for use in n emergeny when one needs to trnsmit quntum stte, ut the quntum hnnel hs roken down. (To e sure, using urrent tehnology it is not possile to preserve pir of quits in fully entngled stte for ny signifint length of time, ut we must leve few prolems to future genertions of engineers.) Crol nd Chrlie n hek whether the lim of Alie nd Bo to e operting good teleporting servie is orret. Crol retes vrious different 1-quit sttes whih she rings to Alie, nd Chrlie mesures the sttes reeived from Bo in the, ψ sis, where ψ is the stte orthogonl to. The outome of one suessful mesurement ould e n ident, ut if things work in, sy, 20 ses, this is some evidene tht teleporttion is tking ple. Teleporttion Ltd., the firm tht employs Alie nd Bo, will not gurntee perfet quntum hnnel, ut insted promises to hieve ertin fidelity F or error rte ǫ, suh s ǫ < 0.01, or F > Alie nd Bo oth know the outomes of the Bell-stte mesurements, i.e., the vlues of D nd D in ny prtiulr se in whih teleporttion is employed, nd one might suppose tht this would provide them some informtion out the stte supplied y Crol. owever, this is not t ll the se: for given, the D nd D outomes re ompletely rndom: eh of the four possiilities for (D, D ) ours with proility of 1/4. This is n exmple of very generl priniple in quntum informtion whih goes under the nme of no loning or no opying, see Se. 4. The si ide is tht quntum hnnel nnot e split into two or more hnnels without introduing some noise. Consequently, if the hnnel from t t 1 to t t 8 in Fig. 2 is perfet hnnel, it is not possile for informtion out t t 8 to e ville nywhere exept in quit itself. The outome of the D nd D mesurements ould e in Alie s noteook (for exmple), 5

6 nd therefore nnot possily tell one nything out. In understnding how the iruit in Fig. 2 funtions, it n e helpful to reple it with the one shown in Fig. 3, whih hs no lssil elements up to time t 8. By onsistent histories rguments, or y the priniple of deferred mesurements in QCQI (p. 186), one n show tht the finl results (D, D, nd ) re the sme. D Alie D Bo Z t 0 t 1 t 2 t 3 t 4 t 5 t 6 t 7 t 8 Figure 3: Alterntive teleporttion iruit. ere detetion tkes ple fter t 8, nd so fr s teleporttion is onerned, nothing would hnge if there were no detetors: the outomes oviously do not influene quit. owever, rrying out the two opertions etween t 6 nd t 8 requires pproprite onnetions etween Alie s nd Bo s lortory, nd these, in turn, neessitte using quntum hnnel. This undermines the originl ide of teleporttion, whih ws to onstrut quntum hnnel without hving to use quntum hnnel! We introdue the iruit in Fig. 3 not s prtil replement for tht in Fig. 2, ut s n id to understnding. Exerise. Assume generl initil stte = α+β 1, nd work out the unitry time development of the three quits in Fig. 3, strting with Ψ 2 = B 0 t t 2. In prtiulr otin Ψ 5 nd Ψ 8 t times t 5 nd t 8. ) Show tht Ψ 8 is produt stte. Then rgue tht it hs to e of the form if the output is to e the sme s the input. Cn you see from Ψ 8 why the outomes of D nd D provide no informtion out? ) Expnd Ψ 5 in the form j,k j k jk, i.e., find the kets jk. Use these to explin why the iruit in Fig. 2 is suessful. ) Show tht t time t 6 in Fig. 3 the informtion out is ontined in quits nd in the sense tht it ould e reovered from them y modifying the iruit t lter times. (This is in ontrst with the sitution t t 6 in the iruit in Fig. 2, where informtion out is not present in the lssil its representing the mesurement outomes.) If the two lssil its representing the mesurement outomes in Fig. 2 ontin no informtion out, where is tht informtion t, sy, t 6? Is it in quit? But how n tht e, given tht the results of the mesurements on nd hve yet to reh Bo s lortory? See NLQI Se. VII for disussion of these questions. The rief nswer is tht the informtion is present in orreltions etween the D nd D outomes nd the quit, the nture of whih will e evident if you did prt () of the preeding exerise. There is nothing prtiulrly weird or osure going on in prtiulr, there re no mgil long-rnge influenes t work for one n onstrut lssil nlogy for suh orreltions, s explined in NLQI. In wht sense is quntum informtion, in ontrst to lssil informtion, teleported? If one were simply onerned with the question of whether quit is in the stte rther thn the orthogonl ψ, this type of informtion n e trnsmitted in lssil fshion y the simple devie of 6

7 mesuring the quit in the, ψ sis, nd sending the informtion over lssil hnnel. Wht the teleporttion iruit llows one to do is to trnsmit n unknown quntum stte without tully determining wht it is. Think of the simple perfet quntum hnnel produed y sending spin-hlf prtile through good pipe, or polrized photon through good optil fier. Wht hppens is tht whtever goes in omes out gin, independent of wht it is tht goes in. In some sense the issue is not quntum informtion, ut the ility to use one iruit or piee of pprtus to trnsmit the lssil informtion distinguishing from ψ for mny different possile hoies of, when the hoie is not speified in dvne. Tht is wht distinguishes quntum hnnel from its lssil ounterprt. 4 No Cloning There is sense in whih quntum informtion nnot e perfetly opied or loned, nd this is expressed in vrious no-loning theorems. The simplest exmple is illustrted in the following figure, where nd hve the sme dimension, ut re otherwise ritrry. T Figure 4: ypothetil loning mhine. Suppose tht T nd re fixed, while n e vried. For prtiulr one n lwys find unitry T suh tht T ( ) is equl to. But there is no fixed T tht will omplish this for ll possile inputs. The rgument is strightforwrd. Suppose the opying iruit n e mde to work for two nonorthogonl normlized sttes ψ nd ψ, nd ssume tht is normlized. Then we hve T ( ψ ) = e iφ ψ ψ, T ( ψ ) = e iφ ψ ψ, (6) where we hve llowed for phses φ nd φ, whih do not ffet the physil interprettion of the finl sttes. Tke the inner produt of the first of these equtions with the seond, nd use the ft tht T T = I. The result is ψ ψ = e i(φ φ ) ( ψ ψ ) 2, (7) nd upon tking the solute vlue of oth sides, ψ ψ = ψ ψ 2. (8) This lst eqution hs two solutions: either ψ ψ is equl to 0 or it is equl to 1. In the first se the two sttes re orthogonl, nd in the seond, sine we hve ssumed tht oth of them re normlized, they re identil prt from phse ftor. (See the exerise following (12).) Both re exluded y our definition of the term nonorthogonl. Conlusion: There is no quntum opying mhine tht n mke two perfet opies (or one perfet opy plus remining perfet originl) of two (or more) nonorthogonl sttes. Notie the qulifition. There is no rule ginst mking s mny perfet opies s one wnts of mutully orthogonl sttes using quntum opying mhine. Sine ny two mrosopilly distint sttes of the world orrespond to orthogonl quntum sttes, there is no similr restrition on opying lssil ojets. Quntum physis is no thret to ordinry photoopying. 7

8 A seond no-loning result n e otined y slight modifition of the ove rgument. One gin, imgine quntum system with time development given y unitry opertor T ting on tensor produt spe, where is of dimension 2 (one quit), wheres is of ritrry size, nd suppose tht Ψ := T ( ψ ) = ψ, (9) tht is, the result is perfet opy or, if one prefers, perfet preservtion of the initil stte ψ. The sttes ψ nd re ssumed to e normlized, nd sine T is unitry, must lso e normlized, ut otherwise we know nothing out it. Unlike (6), there is no need to introdue phse ftor on the right side of this eqution, s it n lwys e inorported into the definition of. Note tht in order to produe perfet opy (or preservtion) on, Ψ in (9) must e produt stte on, not n entngled stte. If we hve n entngled stte, then the proility of otining ψ t the lter time nnot e 1. Exerise. Justify the preeding sttement. [One pproh: Form n orthonorml sis { j } of, with ψ = 0. Expnd Ψ in the { j } with oeffiients in E. Use this to lulte the proility of ψ.] Next suppose there is seond stte ψ nonorthogonl to ψ, whih is lso perfetly opied (or preserved): T ( ψ ) = ψ. (10) Tke the inner produt of (9) with (10). The result is ψ ψ = ψ ψ. (11) Sine ψ nd ψ re nonorthogonl, ψ ψ nnot e 0, so (11) tells us tht = 1. Sine oth nd re normlized, this mens tht =. (12) Exerise. Complete the rgument tht for normlized sttes, = 1 implies tht they re identil. [int: Wht is the norm of?] Also show tht if = 1, is multiplied y some phse ftor e iφ. Sine T is liner opertor, (12) omined with (9) nd (10) tells us tht T ( ) = (13) for ny whih is liner omintion of ψ nd ψ. Beuse ψ nd ψ re nonorthogonl nd thus not multiples of eh other, their liner omintions form two-dimensionl ilert spe, in effet the input of one-quit quntum hnnel. Wht (13) tells us is tht this is perfet hnnel, nd tht no informtion distinguishing different in the hnnel resides in the -independent stte (nd thus in ). It my not e ovious t first how this result pplies to the teleporttion iruit in Fig. 3, sine the input nd output of the hnnel re different: the quit nd the quit, respetively. All one needs to do is to dd t the end of the iruit unitry opertion whih exhnges the nd the quits, so the output is lso the quit, nd let T in (13) e the unitry orresponding to this ugmented iruit. The result n e summrized s follows: if one-quit hnnel is perfet for two nonorthogonl sttes, it is perfet for ll sttes, nd no informtion distinguishing these sttes n lek out of it into the environment. In the sme wy, to hek whether d > 2 hnnel is perfet, it suffies to show tht it is perfet for d nonorthogonl sttes whih together spn the d-dimensionl ilert spe of the hnnel. No informtion n lek out of suh perfet hnnel. Exerise. Wht is ment y d nonorthogonl sttes? Suppose we lel them s φ k, 1 k d. Is it neessry tht φ k φ j e nonzero for ll j nd k, or will the rgument go through with some of these inner produts equl to 0? 8

Project 6: Minigoals Towards Simplifying and Rewriting Expressions

Project 6: Minigoals Towards Simplifying and Rewriting Expressions MAT 51 Wldis Projet 6: Minigols Towrds Simplifying nd Rewriting Expressions The distriutive property nd like terms You hve proly lerned in previous lsses out dding like terms ut one prolem with the wy

More information

1 PYTHAGORAS THEOREM 1. Given a right angled triangle, the square of the hypotenuse is equal to the sum of the squares of the other two sides.

1 PYTHAGORAS THEOREM 1. Given a right angled triangle, the square of the hypotenuse is equal to the sum of the squares of the other two sides. 1 PYTHAGORAS THEOREM 1 1 Pythgors Theorem In this setion we will present geometri proof of the fmous theorem of Pythgors. Given right ngled tringle, the squre of the hypotenuse is equl to the sum of the

More information

where the box contains a finite number of gates from the given collection. Examples of gates that are commonly used are the following: a b

where the box contains a finite number of gates from the given collection. Examples of gates that are commonly used are the following: a b CS 294-2 9/11/04 Quntum Ciruit Model, Solovy-Kitev Theorem, BQP Fll 2004 Leture 4 1 Quntum Ciruit Model 1.1 Clssil Ciruits - Universl Gte Sets A lssil iruit implements multi-output oolen funtion f : {0,1}

More information

Lesson 2: The Pythagorean Theorem and Similar Triangles. A Brief Review of the Pythagorean Theorem.

Lesson 2: The Pythagorean Theorem and Similar Triangles. A Brief Review of the Pythagorean Theorem. 27 Lesson 2: The Pythgoren Theorem nd Similr Tringles A Brief Review of the Pythgoren Theorem. Rell tht n ngle whih mesures 90º is lled right ngle. If one of the ngles of tringle is right ngle, then we

More information

NON-DETERMINISTIC FSA

NON-DETERMINISTIC FSA Tw o types of non-determinism: NON-DETERMINISTIC FS () Multiple strt-sttes; strt-sttes S Q. The lnguge L(M) ={x:x tkes M from some strt-stte to some finl-stte nd ll of x is proessed}. The string x = is

More information

The University of Nottingham SCHOOL OF COMPUTER SCIENCE A LEVEL 2 MODULE, SPRING SEMESTER MACHINES AND THEIR LANGUAGES ANSWERS

The University of Nottingham SCHOOL OF COMPUTER SCIENCE A LEVEL 2 MODULE, SPRING SEMESTER MACHINES AND THEIR LANGUAGES ANSWERS The University of ottinghm SCHOOL OF COMPUTR SCIC A LVL 2 MODUL, SPRIG SMSTR 2015 2016 MACHIS AD THIR LAGUAGS ASWRS Time llowed TWO hours Cndidtes my omplete the front over of their nswer ook nd sign their

More information

CS 573 Automata Theory and Formal Languages

CS 573 Automata Theory and Formal Languages Non-determinism Automt Theory nd Forml Lnguges Professor Leslie Lnder Leture # 3 Septemer 6, 2 To hieve our gol, we need the onept of Non-deterministi Finite Automton with -moves (NFA) An NFA is tuple

More information

Electromagnetism Notes, NYU Spring 2018

Electromagnetism Notes, NYU Spring 2018 Eletromgnetism Notes, NYU Spring 208 April 2, 208 Ation formultion of EM. Free field desription Let us first onsider the free EM field, i.e. in the bsene of ny hrges or urrents. To tret this s mehnil system

More information

QUADRATIC EQUATION. Contents

QUADRATIC EQUATION. Contents QUADRATIC EQUATION Contents Topi Pge No. Theory 0-04 Exerise - 05-09 Exerise - 09-3 Exerise - 3 4-5 Exerise - 4 6 Answer Key 7-8 Syllus Qudrti equtions with rel oeffiients, reltions etween roots nd oeffiients,

More information

12.4 Similarity in Right Triangles

12.4 Similarity in Right Triangles Nme lss Dte 12.4 Similrit in Right Tringles Essentil Question: How does the ltitude to the hpotenuse of right tringle help ou use similr right tringles to solve prolems? Eplore Identifing Similrit in Right

More information

Spacetime and the Quantum World Questions Fall 2010

Spacetime and the Quantum World Questions Fall 2010 Spetime nd the Quntum World Questions Fll 2010 1. Cliker Questions from Clss: (1) In toss of two die, wht is the proility tht the sum of the outomes is 6? () P (x 1 + x 2 = 6) = 1 36 - out 3% () P (x 1

More information

Activities. 4.1 Pythagoras' Theorem 4.2 Spirals 4.3 Clinometers 4.4 Radar 4.5 Posting Parcels 4.6 Interlocking Pipes 4.7 Sine Rule Notes and Solutions

Activities. 4.1 Pythagoras' Theorem 4.2 Spirals 4.3 Clinometers 4.4 Radar 4.5 Posting Parcels 4.6 Interlocking Pipes 4.7 Sine Rule Notes and Solutions MEP: Demonstrtion Projet UNIT 4: Trigonometry UNIT 4 Trigonometry tivities tivities 4. Pythgors' Theorem 4.2 Spirls 4.3 linometers 4.4 Rdr 4.5 Posting Prels 4.6 Interloking Pipes 4.7 Sine Rule Notes nd

More information

Lecture 6: Coding theory

Lecture 6: Coding theory Leture 6: Coing theory Biology 429 Crl Bergstrom Ferury 4, 2008 Soures: This leture loosely follows Cover n Thoms Chpter 5 n Yeung Chpter 3. As usul, some of the text n equtions re tken iretly from those

More information

Lecture Notes No. 10

Lecture Notes No. 10 2.6 System Identifition, Estimtion, nd Lerning Leture otes o. Mrh 3, 26 6 Model Struture of Liner ime Invrint Systems 6. Model Struture In representing dynmil system, the first step is to find n pproprite

More information

Introduction to Olympiad Inequalities

Introduction to Olympiad Inequalities Introdution to Olympid Inequlities Edutionl Studies Progrm HSSP Msshusetts Institute of Tehnology Snj Simonovikj Spring 207 Contents Wrm up nd Am-Gm inequlity 2. Elementry inequlities......................

More information

Intermediate Math Circles Wednesday 17 October 2012 Geometry II: Side Lengths

Intermediate Math Circles Wednesday 17 October 2012 Geometry II: Side Lengths Intermedite Mth Cirles Wednesdy 17 Otoer 01 Geometry II: Side Lengths Lst week we disussed vrious ngle properties. As we progressed through the evening, we proved mny results. This week, we will look t

More information

Intermediate Math Circles Wednesday, November 14, 2018 Finite Automata II. Nickolas Rollick a b b. a b 4

Intermediate Math Circles Wednesday, November 14, 2018 Finite Automata II. Nickolas Rollick a b b. a b 4 Intermedite Mth Circles Wednesdy, Novemer 14, 2018 Finite Automt II Nickols Rollick nrollick@uwterloo.c Regulr Lnguges Lst time, we were introduced to the ide of DFA (deterministic finite utomton), one

More information

6.5 Improper integrals

6.5 Improper integrals Eerpt from "Clulus" 3 AoPS In. www.rtofprolemsolving.om 6.5. IMPROPER INTEGRALS 6.5 Improper integrls As we ve seen, we use the definite integrl R f to ompute the re of the region under the grph of y =

More information

Probability. b a b. a b 32.

Probability. b a b. a b 32. Proility If n event n hppen in '' wys nd fil in '' wys, nd eh of these wys is eqully likely, then proility or the hne, or its hppening is, nd tht of its filing is eg, If in lottery there re prizes nd lnks,

More information

Discrete Structures Lecture 11

Discrete Structures Lecture 11 Introdution Good morning. In this setion we study funtions. A funtion is mpping from one set to nother set or, perhps, from one set to itself. We study the properties of funtions. A mpping my not e funtion.

More information

A Lower Bound for the Length of a Partial Transversal in a Latin Square, Revised Version

A Lower Bound for the Length of a Partial Transversal in a Latin Square, Revised Version A Lower Bound for the Length of Prtil Trnsversl in Ltin Squre, Revised Version Pooy Htmi nd Peter W. Shor Deprtment of Mthemtil Sienes, Shrif University of Tehnology, P.O.Bo 11365-9415, Tehrn, Irn Deprtment

More information

Arrow s Impossibility Theorem

Arrow s Impossibility Theorem Rep Voting Prdoxes Properties Arrow s Theorem Arrow s Impossiility Theorem Leture 12 Arrow s Impossiility Theorem Leture 12, Slide 1 Rep Voting Prdoxes Properties Arrow s Theorem Leture Overview 1 Rep

More information

THE PYTHAGOREAN THEOREM

THE PYTHAGOREAN THEOREM THE PYTHAGOREAN THEOREM The Pythgoren Theorem is one of the most well-known nd widely used theorems in mthemtis. We will first look t n informl investigtion of the Pythgoren Theorem, nd then pply this

More information

Arrow s Impossibility Theorem

Arrow s Impossibility Theorem Rep Fun Gme Properties Arrow s Theorem Arrow s Impossiility Theorem Leture 12 Arrow s Impossiility Theorem Leture 12, Slide 1 Rep Fun Gme Properties Arrow s Theorem Leture Overview 1 Rep 2 Fun Gme 3 Properties

More information

TIME AND STATE IN DISTRIBUTED SYSTEMS

TIME AND STATE IN DISTRIBUTED SYSTEMS Distriuted Systems Fö 5-1 Distriuted Systems Fö 5-2 TIME ND STTE IN DISTRIUTED SYSTEMS 1. Time in Distriuted Systems Time in Distriuted Systems euse eh mhine in distriuted system hs its own lok there is

More information

Chapter 3. Vector Spaces. 3.1 Images and Image Arithmetic

Chapter 3. Vector Spaces. 3.1 Images and Image Arithmetic Chpter 3 Vetor Spes In Chpter 2, we sw tht the set of imges possessed numer of onvenient properties. It turns out tht ny set tht possesses similr onvenient properties n e nlyzed in similr wy. In liner

More information

8 THREE PHASE A.C. CIRCUITS

8 THREE PHASE A.C. CIRCUITS 8 THREE PHSE.. IRUITS The signls in hpter 7 were sinusoidl lternting voltges nd urrents of the so-lled single se type. n emf of suh type n e esily generted y rotting single loop of ondutor (or single winding),

More information

Part I: Study the theorem statement.

Part I: Study the theorem statement. Nme 1 Nme 2 Nme 3 A STUDY OF PYTHAGORAS THEOREM Instrutions: Together in groups of 2 or 3, fill out the following worksheet. You my lift nswers from the reding, or nswer on your own. Turn in one pket for

More information

Algorithm Design and Analysis

Algorithm Design and Analysis Algorithm Design nd Anlysis LECTURE 5 Supplement Greedy Algorithms Cont d Minimizing lteness Ching (NOT overed in leture) Adm Smith 9/8/10 A. Smith; sed on slides y E. Demine, C. Leiserson, S. Rskhodnikov,

More information

Symmetrical Components 1

Symmetrical Components 1 Symmetril Components. Introdution These notes should e red together with Setion. of your text. When performing stedy-stte nlysis of high voltge trnsmission systems, we mke use of the per-phse equivlent

More information

18.06 Problem Set 4 Due Wednesday, Oct. 11, 2006 at 4:00 p.m. in 2-106

18.06 Problem Set 4 Due Wednesday, Oct. 11, 2006 at 4:00 p.m. in 2-106 8. Problem Set Due Wenesy, Ot., t : p.m. in - Problem Mony / Consier the eight vetors 5, 5, 5,..., () List ll of the one-element, linerly epenent sets forme from these. (b) Wht re the two-element, linerly

More information

2.4 Theoretical Foundations

2.4 Theoretical Foundations 2 Progrmming Lnguge Syntx 2.4 Theoretil Fountions As note in the min text, snners n prsers re se on the finite utomt n pushown utomt tht form the ottom two levels of the Chomsky lnguge hierrhy. At eh level

More information

Nondeterministic Automata vs Deterministic Automata

Nondeterministic Automata vs Deterministic Automata Nondeterministi Automt vs Deterministi Automt We lerned tht NFA is onvenient model for showing the reltionships mong regulr grmmrs, FA, nd regulr expressions, nd designing them. However, we know tht n

More information

Review of Gaussian Quadrature method

Review of Gaussian Quadrature method Review of Gussin Qudrture method Nsser M. Asi Spring 006 compiled on Sundy Decemer 1, 017 t 09:1 PM 1 The prolem To find numericl vlue for the integrl of rel vlued function of rel vrile over specific rnge

More information

CS103B Handout 18 Winter 2007 February 28, 2007 Finite Automata

CS103B Handout 18 Winter 2007 February 28, 2007 Finite Automata CS103B ndout 18 Winter 2007 Ferury 28, 2007 Finite Automt Initil text y Mggie Johnson. Introduction Severl childrens gmes fit the following description: Pieces re set up on plying ord; dice re thrown or

More information

GM1 Consolidation Worksheet

GM1 Consolidation Worksheet Cmridge Essentils Mthemtis Core 8 GM1 Consolidtion Worksheet GM1 Consolidtion Worksheet 1 Clulte the size of eh ngle mrked y letter. Give resons for your nswers. or exmple, ngles on stright line dd up

More information

Bases for Vector Spaces

Bases for Vector Spaces Bses for Vector Spces 2-26-25 A set is independent if, roughly speking, there is no redundncy in the set: You cn t uild ny vector in the set s liner comintion of the others A set spns if you cn uild everything

More information

AP Calculus BC Chapter 8: Integration Techniques, L Hopital s Rule and Improper Integrals

AP Calculus BC Chapter 8: Integration Techniques, L Hopital s Rule and Improper Integrals AP Clulus BC Chpter 8: Integrtion Tehniques, L Hopitl s Rule nd Improper Integrls 8. Bsi Integrtion Rules In this setion we will review vrious integrtion strtegies. Strtegies: I. Seprte the integrnd into

More information

Global alignment. Genome Rearrangements Finding preserved genes. Lecture 18

Global alignment. Genome Rearrangements Finding preserved genes. Lecture 18 Computt onl Biology Leture 18 Genome Rerrngements Finding preserved genes We hve seen before how to rerrnge genome to obtin nother one bsed on: Reversls Knowledge of preserved bloks (or genes) Now we re

More information

Tutorial Worksheet. 1. Find all solutions to the linear system by following the given steps. x + 2y + 3z = 2 2x + 3y + z = 4.

Tutorial Worksheet. 1. Find all solutions to the linear system by following the given steps. x + 2y + 3z = 2 2x + 3y + z = 4. Mth 5 Tutoril Week 1 - Jnury 1 1 Nme Setion Tutoril Worksheet 1. Find ll solutions to the liner system by following the given steps x + y + z = x + y + z = 4. y + z = Step 1. Write down the rgumented mtrix

More information

Engr354: Digital Logic Circuits

Engr354: Digital Logic Circuits Engr354: Digitl Logi Ciruits Chpter 4: Logi Optimiztion Curtis Nelson Logi Optimiztion In hpter 4 you will lern out: Synthesis of logi funtions; Anlysis of logi iruits; Tehniques for deriving minimum-ost

More information

CS311 Computational Structures Regular Languages and Regular Grammars. Lecture 6

CS311 Computational Structures Regular Languages and Regular Grammars. Lecture 6 CS311 Computtionl Strutures Regulr Lnguges nd Regulr Grmmrs Leture 6 1 Wht we know so fr: RLs re losed under produt, union nd * Every RL n e written s RE, nd every RE represents RL Every RL n e reognized

More information

Section 1.3 Triangles

Section 1.3 Triangles Se 1.3 Tringles 21 Setion 1.3 Tringles LELING TRINGLE The line segments tht form tringle re lled the sides of the tringle. Eh pir of sides forms n ngle, lled n interior ngle, nd eh tringle hs three interior

More information

Proving the Pythagorean Theorem

Proving the Pythagorean Theorem Proving the Pythgoren Theorem W. Bline Dowler June 30, 2010 Astrt Most people re fmilir with the formul 2 + 2 = 2. However, in most ses, this ws presented in lssroom s n solute with no ttempt t proof or

More information

Algorithm Design and Analysis

Algorithm Design and Analysis Algorithm Design nd Anlysis LECTURE 8 Mx. lteness ont d Optiml Ching Adm Smith 9/12/2008 A. Smith; sed on slides y E. Demine, C. Leiserson, S. Rskhodnikov, K. Wyne Sheduling to Minimizing Lteness Minimizing

More information

Matrices SCHOOL OF ENGINEERING & BUILT ENVIRONMENT. Mathematics (c) 1. Definition of a Matrix

Matrices SCHOOL OF ENGINEERING & BUILT ENVIRONMENT. Mathematics (c) 1. Definition of a Matrix tries Definition of tri mtri is regulr rry of numers enlosed inside rkets SCHOOL OF ENGINEERING & UIL ENVIRONEN Emple he following re ll mtries: ), ) 9, themtis ), d) tries Definition of tri Size of tri

More information

1B40 Practical Skills

1B40 Practical Skills B40 Prcticl Skills Comining uncertinties from severl quntities error propgtion We usully encounter situtions where the result of n experiment is given in terms of two (or more) quntities. We then need

More information

CS 491G Combinatorial Optimization Lecture Notes

CS 491G Combinatorial Optimization Lecture Notes CS 491G Comintoril Optimiztion Leture Notes Dvi Owen July 30, August 1 1 Mthings Figure 1: two possile mthings in simple grph. Definition 1 Given grph G = V, E, mthing is olletion of eges M suh tht e i,

More information

PYTHAGORAS THEOREM WHAT S IN CHAPTER 1? IN THIS CHAPTER YOU WILL:

PYTHAGORAS THEOREM WHAT S IN CHAPTER 1? IN THIS CHAPTER YOU WILL: PYTHAGORAS THEOREM 1 WHAT S IN CHAPTER 1? 1 01 Squres, squre roots nd surds 1 02 Pythgors theorem 1 03 Finding the hypotenuse 1 04 Finding shorter side 1 05 Mixed prolems 1 06 Testing for right-ngled tringles

More information

Comparing the Pre-image and Image of a Dilation

Comparing the Pre-image and Image of a Dilation hpter Summry Key Terms Postultes nd Theorems similr tringles (.1) inluded ngle (.2) inluded side (.2) geometri men (.) indiret mesurement (.6) ngle-ngle Similrity Theorem (.2) Side-Side-Side Similrity

More information

System Validation (IN4387) November 2, 2012, 14:00-17:00

System Validation (IN4387) November 2, 2012, 14:00-17:00 System Vlidtion (IN4387) Novemer 2, 2012, 14:00-17:00 Importnt Notes. The exmintion omprises 5 question in 4 pges. Give omplete explntion nd do not onfine yourself to giving the finl nswer. Good luk! Exerise

More information

CS 373, Spring Solutions to Mock midterm 1 (Based on first midterm in CS 273, Fall 2008.)

CS 373, Spring Solutions to Mock midterm 1 (Based on first midterm in CS 273, Fall 2008.) CS 373, Spring 29. Solutions to Mock midterm (sed on first midterm in CS 273, Fll 28.) Prolem : Short nswer (8 points) The nswers to these prolems should e short nd not complicted. () If n NF M ccepts

More information

I1 = I2 I1 = I2 + I3 I1 + I2 = I3 + I4 I 3

I1 = I2 I1 = I2 + I3 I1 + I2 = I3 + I4 I 3 2 The Prllel Circuit Electric Circuits: Figure 2- elow show ttery nd multiple resistors rrnged in prllel. Ech resistor receives portion of the current from the ttery sed on its resistnce. The split is

More information

How do we solve these things, especially when they get complicated? How do we know when a system has a solution, and when is it unique?

How do we solve these things, especially when they get complicated? How do we know when a system has a solution, and when is it unique? XII. LINEAR ALGEBRA: SOLVING SYSTEMS OF EQUATIONS Tody we re going to tlk out solving systems of liner equtions. These re prolems tht give couple of equtions with couple of unknowns, like: 6= x + x 7=

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

Counting Paths Between Vertices. Isomorphism of Graphs. Isomorphism of Graphs. Isomorphism of Graphs. Isomorphism of Graphs. Isomorphism of Graphs

Counting Paths Between Vertices. Isomorphism of Graphs. Isomorphism of Graphs. Isomorphism of Graphs. Isomorphism of Graphs. Isomorphism of Graphs Isomorphism of Grphs Definition The simple grphs G 1 = (V 1, E 1 ) n G = (V, E ) re isomorphi if there is ijetion (n oneto-one n onto funtion) f from V 1 to V with the property tht n re jent in G 1 if

More information

2.4 Linear Inequalities and Interval Notation

2.4 Linear Inequalities and Interval Notation .4 Liner Inequlities nd Intervl Nottion We wnt to solve equtions tht hve n inequlity symol insted of n equl sign. There re four inequlity symols tht we will look t: Less thn , Less thn or

More information

Linear Algebra Introduction

Linear Algebra Introduction Introdution Wht is Liner Alger out? Liner Alger is rnh of mthemtis whih emerged yers k nd ws one of the pioneer rnhes of mthemtis Though, initilly it strted with solving of the simple liner eqution x +

More information

Designing Information Devices and Systems I Spring 2018 Homework 7

Designing Information Devices and Systems I Spring 2018 Homework 7 EECS 16A Designing Informtion Devices nd Systems I Spring 2018 omework 7 This homework is due Mrch 12, 2018, t 23:59. Self-grdes re due Mrch 15, 2018, t 23:59. Sumission Formt Your homework sumission should

More information

CS241 Week 6 Tutorial Solutions

CS241 Week 6 Tutorial Solutions 241 Week 6 Tutoril olutions Lnguges: nning & ontext-free Grmmrs Winter 2018 1 nning Exerises 1. 0x0x0xd HEXINT 0x0 I x0xd 2. 0xend--- HEXINT 0xe I nd ER -- MINU - 3. 1234-120x INT 1234 INT -120 I x 4.

More information

Computational Biology Lecture 18: Genome rearrangements, finding maximal matches Saad Mneimneh

Computational Biology Lecture 18: Genome rearrangements, finding maximal matches Saad Mneimneh Computtionl Biology Leture 8: Genome rerrngements, finding miml mthes Sd Mneimneh We hve seen how to rerrnge genome to otin nother one sed on reversls nd the knowledge of the preserved loks or genes. Now

More information

, g. Exercise 1. Generator polynomials of a convolutional code, given in binary form, are g. Solution 1.

, g. Exercise 1. Generator polynomials of a convolutional code, given in binary form, are g. Solution 1. Exerise Genertor polynomils of onvolutionl ode, given in binry form, re g, g j g. ) Sketh the enoding iruit. b) Sketh the stte digrm. ) Find the trnsfer funtion T. d) Wht is the minimum free distne of

More information

Chapter 4 State-Space Planning

Chapter 4 State-Space Planning Leture slides for Automted Plnning: Theory nd Prtie Chpter 4 Stte-Spe Plnning Dn S. Nu CMSC 722, AI Plnning University of Mrylnd, Spring 2008 1 Motivtion Nerly ll plnning proedures re serh proedures Different

More information

SECTION A STUDENT MATERIAL. Part 1. What and Why.?

SECTION A STUDENT MATERIAL. Part 1. What and Why.? SECTION A STUDENT MATERIAL Prt Wht nd Wh.? Student Mteril Prt Prolem n > 0 n > 0 Is the onverse true? Prolem If n is even then n is even. If n is even then n is even. Wht nd Wh? Eploring Pure Mths Are

More information

Numbers and indices. 1.1 Fractions. GCSE C Example 1. Handy hint. Key point

Numbers and indices. 1.1 Fractions. GCSE C Example 1. Handy hint. Key point GCSE C Emple 7 Work out 9 Give your nswer in its simplest form Numers n inies Reiprote mens invert or turn upsie own The reiprol of is 9 9 Mke sure you only invert the frtion you re iviing y 7 You multiply

More information

1 Nondeterministic Finite Automata

1 Nondeterministic Finite Automata 1 Nondeterministic Finite Automt Suppose in life, whenever you hd choice, you could try oth possiilities nd live your life. At the end, you would go ck nd choose the one tht worked out the est. Then you

More information

Chapter 8 Roots and Radicals

Chapter 8 Roots and Radicals Chpter 8 Roots nd Rdils 7 ROOTS AND RADICALS 8 Figure 8. Grphene is n inredily strong nd flexile mteril mde from ron. It n lso ondut eletriity. Notie the hexgonl grid pttern. (redit: AlexnderAIUS / Wikimedi

More information

Polynomials. Polynomials. Curriculum Ready ACMNA:

Polynomials. Polynomials. Curriculum Ready ACMNA: Polynomils Polynomils Curriulum Redy ACMNA: 66 www.mthletis.om Polynomils POLYNOMIALS A polynomil is mthemtil expression with one vrile whose powers re neither negtive nor frtions. The power in eh expression

More information

Quantum Nonlocality Pt. 2: No-Signaling and Local Hidden Variables May 1, / 16

Quantum Nonlocality Pt. 2: No-Signaling and Local Hidden Variables May 1, / 16 Quntum Nonloclity Pt. 2: No-Signling nd Locl Hidden Vriles My 1, 2018 Quntum Nonloclity Pt. 2: No-Signling nd Locl Hidden Vriles My 1, 2018 1 / 16 Non-Signling Boxes The primry lesson from lst lecture

More information

ILLUSTRATING THE EXTENSION OF A SPECIAL PROPERTY OF CUBIC POLYNOMIALS TO NTH DEGREE POLYNOMIALS

ILLUSTRATING THE EXTENSION OF A SPECIAL PROPERTY OF CUBIC POLYNOMIALS TO NTH DEGREE POLYNOMIALS ILLUSTRATING THE EXTENSION OF A SPECIAL PROPERTY OF CUBIC POLYNOMIALS TO NTH DEGREE POLYNOMIALS Dvid Miller West Virgini University P.O. BOX 6310 30 Armstrong Hll Morgntown, WV 6506 millerd@mth.wvu.edu

More information

p-adic Egyptian Fractions

p-adic Egyptian Fractions p-adic Egyptin Frctions Contents 1 Introduction 1 2 Trditionl Egyptin Frctions nd Greedy Algorithm 2 3 Set-up 3 4 p-greedy Algorithm 5 5 p-egyptin Trditionl 10 6 Conclusion 1 Introduction An Egyptin frction

More information

Finite State Automata and Determinisation

Finite State Automata and Determinisation Finite Stte Automt nd Deterministion Tim Dworn Jnury, 2016 Lnguges fs nf re df Deterministion 2 Outline 1 Lnguges 2 Finite Stte Automt (fs) 3 Non-deterministi Finite Stte Automt (nf) 4 Regulr Expressions

More information

Math 32B Discussion Session Week 8 Notes February 28 and March 2, f(b) f(a) = f (t)dt (1)

Math 32B Discussion Session Week 8 Notes February 28 and March 2, f(b) f(a) = f (t)dt (1) Green s Theorem Mth 3B isussion Session Week 8 Notes Februry 8 nd Mrh, 7 Very shortly fter you lerned how to integrte single-vrible funtions, you lerned the Fundmentl Theorem of lulus the wy most integrtion

More information

Review Topic 14: Relationships between two numerical variables

Review Topic 14: Relationships between two numerical variables Review Topi 14: Reltionships etween two numeril vriles Multiple hoie 1. Whih of the following stterplots est demonstrtes line of est fit? A B C D E 2. The regression line eqution for the following grph

More information

PAIR OF LINEAR EQUATIONS IN TWO VARIABLES

PAIR OF LINEAR EQUATIONS IN TWO VARIABLES PAIR OF LINEAR EQUATIONS IN TWO VARIABLES. Two liner equtions in the sme two vriles re lled pir of liner equtions in two vriles. The most generl form of pir of liner equtions is x + y + 0 x + y + 0 where,,,,,,

More information

EE 330/330L Energy Systems (Spring 2012) Laboratory 1 Three-Phase Loads

EE 330/330L Energy Systems (Spring 2012) Laboratory 1 Three-Phase Loads ee330_spring2012_l_01_3phse_lods.do 1/5 EE 330/330L Energy Systems (Spring 2012) Lortory 1 ThreePhse Lods Introdution/Bkground In this lortory, you will mesure nd study the voltges, urrents, impednes,

More information

Interpreting Integrals and the Fundamental Theorem

Interpreting Integrals and the Fundamental Theorem Interpreting Integrls nd the Fundmentl Theorem Tody, we go further in interpreting the mening of the definite integrl. Using Units to Aid Interprettion We lredy know tht if f(t) is the rte of chnge of

More information

expression simply by forming an OR of the ANDs of all input variables for which the output is

expression simply by forming an OR of the ANDs of all input variables for which the output is 2.4 Logic Minimiztion nd Krnugh Mps As we found ove, given truth tle, it is lwys possile to write down correct logic expression simply y forming n OR of the ANDs of ll input vriles for which the output

More information

C/CS/Phys C191 Bell Inequalities, No Cloning, Teleportation 9/13/07 Fall 2007 Lecture 6

C/CS/Phys C191 Bell Inequalities, No Cloning, Teleportation 9/13/07 Fall 2007 Lecture 6 C/CS/Phys C9 Bell Inequlities, o Cloning, Teleporttion 9/3/7 Fll 7 Lecture 6 Redings Benenti, Csti, nd Strini: o Cloning Ch.4. Teleporttion Ch. 4.5 Bell inequlities See lecture notes from H. Muchi, Cltech,

More information

5. Every rational number have either terminating or repeating (recurring) decimal representation.

5. Every rational number have either terminating or repeating (recurring) decimal representation. CHAPTER NUMBER SYSTEMS Points to Rememer :. Numer used for ounting,,,,... re known s Nturl numers.. All nturl numers together with zero i.e. 0,,,,,... re known s whole numers.. All nturl numers, zero nd

More information

Lecture 1 - Introduction and Basic Facts about PDEs

Lecture 1 - Introduction and Basic Facts about PDEs * 18.15 - Introdution to PDEs, Fll 004 Prof. Gigliol Stffilni Leture 1 - Introdution nd Bsi Fts bout PDEs The Content of the Course Definition of Prtil Differentil Eqution (PDE) Liner PDEs VVVVVVVVVVVVVVVVVVVV

More information

Technische Universität München Winter term 2009/10 I7 Prof. J. Esparza / J. Křetínský / M. Luttenberger 11. Februar Solution

Technische Universität München Winter term 2009/10 I7 Prof. J. Esparza / J. Křetínský / M. Luttenberger 11. Februar Solution Tehnishe Universität Münhen Winter term 29/ I7 Prof. J. Esprz / J. Křetínský / M. Luttenerger. Ferur 2 Solution Automt nd Forml Lnguges Homework 2 Due 5..29. Exerise 2. Let A e the following finite utomton:

More information

Name Solutions to Test 3 November 8, 2017

Name Solutions to Test 3 November 8, 2017 Nme Solutions to Test 3 November 8, 07 This test consists of three prts. Plese note tht in prts II nd III, you cn skip one question of those offered. Some possibly useful formuls cn be found below. Brrier

More information

(a) A partition P of [a, b] is a finite subset of [a, b] containing a and b. If Q is another partition and P Q, then Q is a refinement of P.

(a) A partition P of [a, b] is a finite subset of [a, b] containing a and b. If Q is another partition and P Q, then Q is a refinement of P. Chpter 7: The Riemnn Integrl When the derivtive is introdued, it is not hrd to see tht the it of the differene quotient should be equl to the slope of the tngent line, or when the horizontl xis is time

More information

Green s Theorem. (2x e y ) da. (2x e y ) dx dy. x 2 xe y. (1 e y ) dy. y=1. = y e y. y=0. = 2 e

Green s Theorem. (2x e y ) da. (2x e y ) dx dy. x 2 xe y. (1 e y ) dy. y=1. = y e y. y=0. = 2 e Green s Theorem. Let be the boundry of the unit squre, y, oriented ounterlokwise, nd let F be the vetor field F, y e y +, 2 y. Find F d r. Solution. Let s write P, y e y + nd Q, y 2 y, so tht F P, Q. Let

More information

Part 4. Integration (with Proofs)

Part 4. Integration (with Proofs) Prt 4. Integrtion (with Proofs) 4.1 Definition Definition A prtition P of [, b] is finite set of points {x 0, x 1,..., x n } with = x 0 < x 1

More information

CSE 332. Sorting. Data Abstractions. CSE 332: Data Abstractions. QuickSort Cutoff 1. Where We Are 2. Bounding The MAXIMUM Problem 4

CSE 332. Sorting. Data Abstractions. CSE 332: Data Abstractions. QuickSort Cutoff 1. Where We Are 2. Bounding The MAXIMUM Problem 4 Am Blnk Leture 13 Winter 2016 CSE 332 CSE 332: Dt Astrtions Sorting Dt Astrtions QuikSort Cutoff 1 Where We Are 2 For smll n, the reursion is wste. The onstnts on quik/merge sort re higher thn the ones

More information

Lecture 3: Equivalence Relations

Lecture 3: Equivalence Relations Mthcmp Crsh Course Instructor: Pdric Brtlett Lecture 3: Equivlence Reltions Week 1 Mthcmp 2014 In our lst three tlks of this clss, we shift the focus of our tlks from proof techniques to proof concepts

More information

DEFINITION The inner product of two functions f 1 and f 2 on an interval [a, b] is the number. ( f 1, f 2 ) b DEFINITION 11.1.

DEFINITION The inner product of two functions f 1 and f 2 on an interval [a, b] is the number. ( f 1, f 2 ) b DEFINITION 11.1. 398 CHAPTER 11 ORTHOGONAL FUNCTIONS AND FOURIER SERIES 11.1 ORTHOGONAL FUNCTIONS REVIEW MATERIAL The notions of generlized vectors nd vector spces cn e found in ny liner lger text. INTRODUCTION The concepts

More information

Algorithms & Data Structures Homework 8 HS 18 Exercise Class (Room & TA): Submitted by: Peer Feedback by: Points:

Algorithms & Data Structures Homework 8 HS 18 Exercise Class (Room & TA): Submitted by: Peer Feedback by: Points: Eidgenössishe Tehnishe Hohshule Zürih Eole polytehnique fédérle de Zurih Politenio federle di Zurigo Federl Institute of Tehnology t Zurih Deprtement of Computer Siene. Novemer 0 Mrkus Püshel, Dvid Steurer

More information

Factorising FACTORISING.

Factorising FACTORISING. Ftorising FACTORISING www.mthletis.om.u Ftorising FACTORISING Ftorising is the opposite of expning. It is the proess of putting expressions into rkets rther thn expning them out. In this setion you will

More information

Properties of Integrals, Indefinite Integrals. Goals: Definition of the Definite Integral Integral Calculations using Antiderivatives

Properties of Integrals, Indefinite Integrals. Goals: Definition of the Definite Integral Integral Calculations using Antiderivatives Block #6: Properties of Integrls, Indefinite Integrls Gols: Definition of the Definite Integrl Integrl Clcultions using Antiderivtives Properties of Integrls The Indefinite Integrl 1 Riemnn Sums - 1 Riemnn

More information

Exercise 3 Logic Control

Exercise 3 Logic Control Exerise 3 Logi Control OBJECTIVE The ojetive of this exerise is giving n introdution to pplition of Logi Control System (LCS). Tody, LCS is implemented through Progrmmle Logi Controller (PLC) whih is lled

More information

TOPIC: LINEAR ALGEBRA MATRICES

TOPIC: LINEAR ALGEBRA MATRICES Interntionl Blurete LECTUE NOTES for FUTHE MATHEMATICS Dr TOPIC: LINEA ALGEBA MATICES. DEFINITION OF A MATIX MATIX OPEATIONS.. THE DETEMINANT deta THE INVESE A -... SYSTEMS OF LINEA EQUATIONS. 8. THE AUGMENTED

More information

Dorf, R.C., Wan, Z. T- Equivalent Networks The Electrical Engineering Handbook Ed. Richard C. Dorf Boca Raton: CRC Press LLC, 2000

Dorf, R.C., Wan, Z. T- Equivalent Networks The Electrical Engineering Handbook Ed. Richard C. Dorf Boca Raton: CRC Press LLC, 2000 orf, R.C., Wn,. T- Equivlent Networks The Eletril Engineering Hndook Ed. Rihrd C. orf Bo Rton: CRC Press LLC, 000 9 T P Equivlent Networks hen Wn University of Cliforni, vis Rihrd C. orf University of

More information

Improper Integrals. The First Fundamental Theorem of Calculus, as we ve discussed in class, goes as follows:

Improper Integrals. The First Fundamental Theorem of Calculus, as we ve discussed in class, goes as follows: Improper Integrls The First Fundmentl Theorem of Clculus, s we ve discussed in clss, goes s follows: If f is continuous on the intervl [, ] nd F is function for which F t = ft, then ftdt = F F. An integrl

More information

Solutions for HW9. Bipartite: put the red vertices in V 1 and the black in V 2. Not bipartite!

Solutions for HW9. Bipartite: put the red vertices in V 1 and the black in V 2. Not bipartite! Solutions for HW9 Exerise 28. () Drw C 6, W 6 K 6, n K 5,3. C 6 : W 6 : K 6 : K 5,3 : () Whih of the following re iprtite? Justify your nswer. Biprtite: put the re verties in V 1 n the lk in V 2. Biprtite:

More information

Designing Information Devices and Systems I Discussion 8B

Designing Information Devices and Systems I Discussion 8B Lst Updted: 2018-10-17 19:40 1 EECS 16A Fll 2018 Designing Informtion Devices nd Systems I Discussion 8B 1. Why Bother With Thévenin Anywy? () Find Thévenin eqiuvlent for the circuit shown elow. 2kΩ 5V

More information

Chapter 0. What is the Lebesgue integral about?

Chapter 0. What is the Lebesgue integral about? Chpter 0. Wht is the Lebesgue integrl bout? The pln is to hve tutoril sheet ech week, most often on Fridy, (to be done during the clss) where you will try to get used to the ides introduced in the previous

More information

Lecture 08: Feb. 08, 2019

Lecture 08: Feb. 08, 2019 4CS4-6:Theory of Computtion(Closure on Reg. Lngs., regex to NDFA, DFA to regex) Prof. K.R. Chowdhry Lecture 08: Fe. 08, 2019 : Professor of CS Disclimer: These notes hve not een sujected to the usul scrutiny

More information