Logic Controllers 1. normally open contact normally closed contact. George Boole, ( ), Irish mathematician, Analysis of Logic).
|
|
- Madison Wilkinson
- 5 years ago
- Views:
Transcription
1 Logi Controllers Logil ontrol Exmples of equipments for logil ontrol A simple ON-OFF swith with two terminls normll open ontt normll losed ontt rel ontts oil rmture ontts Contts push utton oil oke A oil of wire is wrpped round soft iron ore, el A rel is swith whih is operted eletrill. Mn rels use oil s n eletromgnet to t swithing mehnism. Normll-open ontts onnet the iruit when the rel is tivted; nd disonnet when the rels is detivted. Tpes of logi : omintionl logi sequentil logi. Boolen lger George Boole, (85-864), Irish mthemtiin, Anlsis of Logi).: Two vlues of logil vriles: true / flse, logil / logil, high / low. A logil funtion is s follows f (,,,... ) where,, re independent vriles nd is dependent vrile Digrm desriing three logil funtions of the three independent vriles Comintionl logi CL Definition of logil funtions Verl desription Truth tles Krnugh mps Boolen expressions Let k e numer of logil vriles then the numer of the possile omintions of vlues etween them, nd there re N 2 k ws of ssigning n output vlue to eh of these k-input vlues
2 Truth tle (for 3 vriles there re 8 ws of ssigning the output vlue of to the input vlues of the 3 independent vriles) Krnugh mps Index Independent vrile Dependent vrile vrile: 2 vriles: 3 vriles: 4 vriles: d 5 vriles: d e
3 Logi Controllers 3 3 Bsi logil opertions (elementr funtions) Not funtion Logil disjuntion NOT opertion Opertor: (see exmples elow) Formul: ( NOT, x ) Truth tle: O opertion Opertor: Formul: Truth tle: logil dd (join), ( O ) Logil onjuntion Exlusive O AND opertion logil multipl Opertor:, Formul: ( AND ) Truth tle: XO opertion onl one out of n Opertor: Formul: Truth tle: heffer funtion (AND-NOT opertion) Piere funtion (O-NOT opertion) NAND Formul: Truth tle: heffer stroke opertion ( NAND ) NO Formul: Truth tle: ( NO )
4 Equivlene Non-equivlene E Formul: Truth tle: E NE Formul: Truth tle: NE Implition elongs to the logil elementr funtions. Opertor, formul Gtes of the retngulr shpe NOT (invertor) AND gte O gte XO gte NAND gte NO gte E gte E Distintive shpe NOT (invertor) AND gte O gte XO gte NAND gte NO gte A Venn digrm or set digrm is digrm tht shows ll possile logil reltions etween finite olletion of sets (ggregtion of things).
5 Logi Controllers 5 4 Lws nd theorems of Boolen lger Commuttive lw,, Assoitive lw ( ) ( ), ( ) ( ) Distriutive lw ( ), ( ) ( ). Involution lw. Dulit lws nd theorems explins dulit in mth s smmetr within mthemtil sstem suh tht theorem remins vlid if ertin ojets, reltions, or opertions re interhnged. The dul form of lw nd theorem n e otined replement of logil logil nd vie vers nd simultneousl replement of disjuntion onjuntion nd vie vers. The logil is the dul vlue of the logil nd disjuntion is the dul opertion of onjuntion: nd Dul forms of lws nd theorems Nme Logil disjuntion Logil onjuntion Lws of omplementr Opertion with nd Opertion with nd Idempotent lw implifition Theorem ( ) DeMorgn s lw ( ) Prove of lws nd theorems A) Algerill B) Using the truth tle
6 De Morgn equivlents De Morgn lw 5 Cnonil form of logil funtions In Boolen lger, n oolen funtion n e expressed in nonil form using the dul onepts of minterms (miniml terms) nd mxterms. Minterms re lled produts euse the re the AND of set of vriles, nd mxterms re lled sums euse the re the O of set of vriles. The set of vriles differs from eh other in suset of vriles, whih re inverted the NOT funtion. We n s tht the minterm is produt term in whih eh of the vriles ppers one (in either its omplemented or unomplemented form). Thus, minterm is logil expression of n vriles tht emplos onl the omplement opertor nd the onjuntion opertor. For three vriles (n 3) ll the minterms re s follows,,,,,,,. These onepts re lled duls euse of their omplementr-smmetr reltionship s expressed De Morgn's lws, whih stte tht AND( x,, z,... ) NO( x,, z,... ) nd O x,, z,... NAND x,, z,.... ( ) ( ) Note: AND ( x, ) x, NAND ( x, ) x, O ( x, ) x nd ( x, ) x NO. The dul nonil forms of n oolen funtion re "sum of minterms" nd "produt of mxterms." The term "um of Produts" or "op" is widel used for the nonil (in simplest or stndrd) form tht is disjuntion (O) of minterms. Its De Morgn dul is "Produt of ums" or "Po" for the nonil form tht is onjuntion (AND) of mxterms. These forms llow for greter nlsis into the simplifition of these funtions, whih is of gret importne in the minimiztion or other optimiztion of digitl iruits. Let truth tle e given
7 Logi Controllers 7 A) The formul is omposed s sum of logil produts (minterms), whih re omposed of 3 vriles in the form, resulting in the logil ee tht,, ontriutes to the sum funtion vlue of the logil. B) The formul is omposed s produt of logil sums (mxterms), whih re omposed of 3 vriles, resulting in the logil (...)... ( )... (...) ee tht,, ontriutes to the produt funtion vlue of the logil. Exmple: A) um of onjuntions (op) B) Produt of disjuntions (Po) ( ) ( ) Proof tht oth the results give the sme result Ad A) ( ) ( ) ( ) Ad B) (( ) ) ( ) ( ) 6 The use of Krnugh mps to retion logil funtion A Krnugh mp is grphil w of minimizing Boolen expression sed on the rule of omplementtion. It works well if there re 2, 3, or 4 vriles, ut gets mess or impossile to use for expressions with more vriles thn tht. A Krnugh mp uses new term lled minterm. For oolen funtion of n vriles x, x 2,, x n, the minterm is produt term in whih eh of the n vriles ppers one (in either its omplemented or unomplemented form). Thus, minterm is logil expression of n vriles tht emplos onl the omplement opertor nd the onjuntion opertor. The ide ehind Krnugh mp (Krnugh, 953) is to drw n expression s truth tle s mtrixes in suh w tht eh row nd eh olumn of the mtrix puts minterms tht differ in the vlue of single vrile djent to eh other. Then, grouping djent ells of the mtrix, ou n identif produt terms tht eliminte ll omplemented literls, resulting in minimized version of the expression. The Krnugh mp is used to produe miniml sum of produts implementtion of n expression drwing retngles round groups of djent minterms in the mp; eh retngle will orrespond to one produt term, nd the full expression will e onstruted s the O (sum) of ll the produt
8 terms. The gol is to hve s few produt terms s possile, whih implies tht eh produt term will ount for s mn minterms s possile. Exmple Let truth tle e speifing the logil funtion of the form The Krnugh mp n e reted on the se of this funtion. Now the solution of the prolem strts. It is required to design the miniml form of this funtion using the Krnugh mp. 3 2 : ( ) 2: ( ) 3: ( ) Notie tht two minterms omposed of 3 vriles gives one minterm omposed of 2 vriles, whih simplified onsiderl the resulting formul. The finl minimized formul is s follows ere re the rules for lotion the irles enlosing prt of the Krnugh mp of the retngle shpe: Ever minterm must e inside t lest one irle, ut there must not e n zeros inside n irle. Ever retngle hs to e s lrge s possile. Cirles m wrp round to inlude ells in oth the leftmost nd rightmost olumns. likewise for the top nd ottom rows. The numer of minterms enlosed in irle must e power of two (, 2, 4, 8, or 6 minterms for 4-vrile mps). ome funtions hve "don t re" onditions, whih re omintions of inputs tht will never our, resulting in ses where it doesn t mtter whether the output is zero or one. Where these don t re onditions pper in Krnugh Mp (usull indited X s insted of ones or zeros), the m e inluded inside irles or not depending on wht will mke the irles s few nd s lrge s possile.. Pirs
9 Logi Controllers 9 d d d d d d d d There re omintions of the possile vlues of the independent vriles, whih nnot exist in the rel world (for instne the lift nnot e simultneousl in two different floors). In this se the output vlue is sustituted X. The dependent vlue is repled the vlue, whih is profitle for minimizing the resulting formul. X 7 Design of the logil ontrol sstems el Integrted iruits Progrm ode. el logi Logil funtions nd ontt(s) rel oil V V V Logil funtions nd V V V V V
10 Exmple V V Ldder digrm Funtion Blok digrms Integrted iruits (IC) 5V input T T 2 v E K T 3 output nother gtes V NAND gte with 2 inputs N 74N NAND nd NO logil gtes re the two pillrs of logi, in tht ll other tpes of Boolen logil gtes (i.e., AND, O, NOT, XO, XNO) n e reted from suitle network of just NAND or just NO gte(s). The n e uilt from rels or trnsistors, or n other tehnolog tht n rete n inverter nd two-input AND or O gte. ene the NAND nd NO gtes re lled the universl gtes. Min triks The design of the logil AND using onl NAND gtes ( ) The design of the logil O using onl NAND gtes The design of the logil AND using onl NO gtes The design of the logil O using onl NO gtes ( )
11 Logi Controllers NOT AND O NAND NO Integrted monolithi iruits on the mrket re produed with the ertin numer of inputs, for exmple 2, 4, 8. The design of the logil iruit hs to respet this ft. The importnt prt of tsk to e solved is the numer of the gte inputs. In the other word it is needed to design the ontrol sstem flowhrt using onl gtes with given numer of inputs. The design of the ontrol sstem flowhrt for the logil disjuntion or onjuntion omposed of 3 vriles using NAND gtes with onl 2 inputs ( ) ( ) ( ) ( ) ( ) ( ) ( ) ( ) ( ) ( ) ( ) ( ) ( ) The smol n designtes gte, indexed n, with 2 inputs. When the hrt for the logil produt of 3 vriles (,, ) is drwn, ou should strt t the gte 4 hving s n input the output of the gte 3, nd then ou should ontinue onneting the output of the gte 2 nd the vrile to the input of the gte 3. The design of the ontrol sstem flowhrt for the logil disjuntion or onjuntion omposed of 3 vriles using NOD gtes with onl 2 inputs ( ) ( ) ( ) ( ) ( ) ( ) ( ) ( ) ( ) ( ) ( ) ( ) ( )
12 Progrmmle Logi Controllers - PLC Computer tools supporting the design of logi ontrol sstems re sed on Ldder Digrm LAD, Kontktpln KOP in Germn Control stem Flowhrt CF, Funktions pln FUP in Germn ttement list TL, Anweisungsliste AWL in Germn trutured Text (T) 8 Exmple The first prt of the truth tle The seond prt of the truth tle d A d Krnugh mp X X d The minimized form of the logil formul d Ldder digrm d To rete lok digrm the formul hs to e dpted to the gtes whih re emploed For NAND gtes V V ( ) d d d d d d ( )
13 Logi Controllers 3 For NO gtes ( ) d ( ) d ( ) d d d d d d 9 equentil logi Let logil funtion e defined formul f (,,,,... ) P 3P CL Memor 2 3 where P is the pst vlue of the oolen vrile Clok Exmple of liquid level ontrol sstem sed on logil ontroller Fill vlve Tnk Vlve for drining Two liquid level guges h high level h 2 low level z Controlled sstem Vlves re onsidered to e either full opened ( or z ) or ompletel losed ( or z ). The drin vlve is ontrolled independentl of the inlet (fill) vlve. The liquid level guge provides logil signl if the liquid level is ove ertin level or logil signl if the level is elow mentioned level. A tnk whih is filled with ondutive liquid h 2 h ON-OFF sensors sed on eletril ondutivit The Krnugh mp for the output logil vrile of the logil ontrol sstem. P h 2 X X h
14 Logil funtion for the omintionl logi h 2 P h Adpting for using NAND gtes h 2 h2 P h h2 P h h h P h Flip-flops ; A flip-flop or lth is iruit tht hs two stle sttes nd n e used to store stte informtion. Flip-flops nd lthes re fundmentl uilding lok of digitl eletronis sstems used in omputers, ommunitions, nd mn other tpes of sstems. Flip-flops n e either simple (trnsprent or opque) or loked (snhronous or edge-triggered); the simple ones re ommonl lled lthes. The word lth is minl used for storge elements, while loked devies re desried s flip-flops. Logi iruits re divided into snhronous nd snhronous tpes. In snhronous sequentil iruits, the stte hnges onl t disrete times in response to lok signl. In snhronous iruits the stte of the devie n hnge t n time in response to hnging inputs. Mehnil flip-flop tpe whih hnges its stte snhronousl set output reset - high L - low time Timing digrm Truth tle Krnugh mp for the output logil vrile Previous output X X? P P X X The logil funtion for design Ldder Digrm ( ) P P Where P is the pst vlue of P The output is energized even when the input eses. This is lled lth iruits. V V
15 Logi Controllers 5 The use of the NO nd NAND gtes to uild the flip-flops of the tpe Gtes NO: ( ) ( ) Gtes NAND: ( ) P P P P D tpe whih hnge its stte snhronousl with lok signl The D flip-flop n e viewed s memor ell, whih is set or reset snhronousl with lok signl D Clok Clok D Timing digrm time JK tpe whih hnge its stte snhronousl with lok signl nhr. Clok Asnhr. J K C Truth tle: J K n n n Using flip-flop iruits in sequentil iruits The use of the tpe flip-flops The prolem is to design two logil funtion generting the set nd reset signls: f f ( h, h2 ) ( h, h ) 2 h h 2 f f A liquid level ontrol sstem sed on logil ontroller X h 2 Funtion for setting the set input of the flip-flops h 2 X h 2 Funtion for setting the reset input of the flipflops h h h
16 Conttors A onttor is n eletrill ontrolled swith used for swithing power iruit. The onttor is similr to rel exept with higher llowed urrent rtings to ontrol n equipment of the high power level. A onttor is ontrolled iruit whih hs muh lower power level thn the swithed iruit. Green utton el oil Conttor oil Min ontts Conttor Auxilr ontts ed utton P Auxilir ontt Lights Min ontts 22V~ V~ The onttors re used to ontrol eletri motors, lighting, heting, pitor nks, nd other eletril lods. Pushuttons re often olor-oded to ssoite them with their funtion. Commonl used olors re red for stopping the mhine or proess nd green for strting the mhine or proess. The use of JK flip-flop tpe for ounting pulses exdeiml ounter for N,, 5 Output Output Output 2 Output Input pulses T C C C C eset It is ssumed tht if the J nd K inputs re not onneted to the other outputs of gtes or flip-flops or re not grounded then J nd K 3 2 N
17 Logi Controllers 7 Timing digrm T time Binr-oded deiml ounter 2 3 Input pulses T eset exdeiml ounter 3 2 even-segment displ 2 3 Deoder CL A B G DP deiml point 2 IEC 3 equentil Funtion Chrts equentil funtion hrts re sed on teps with ssoited tions Trnsitions with ssoited logil onditions Direted links etween steps nd trnsitions FC equentil onfigurtion initil step trnsition step 2 trnsition 2 step 3 s s 2 ondition tion ondition 2 s 3 tion 2 s, s 2, internl logil vriles Trnsition is enled if the ondition rehes logil vlue equl to logil One of steps on the left digrm is tive while the others re intive.
18 FC imultneous Brnh In simultneous rnh, ll rnhes re exeuted until the trnsition eomes tive. FC eletion Brnh In seletion rnh, onl one rnh is exeuted depending on whih trnsition is tive. Divergent nd onvergent AND Divergent nd onvergent O Progrm ode tte vriles s, s 2,, trnsition onditions for trnsition p, p 2, nd tions, 2,, The initil vlue of ini fter power ON is zero s s p s s ini n n s2 s p s2 s3 s3 s2 p2 s3 s4... s2 2 s3... n sn ini 2 Cli hnging of sttes Assignment of the outputs ini Exmple of sequentil funtion hrt for the tpe flip-flops. s with OFF Button TAT s 2 with ON TAT TOP Button TOP
19 Logi Controllers 9 Funtionl digrm of tehnologil proess vlve vlve 2 tnk v v 3 h h 2 tnk 3 v 4 v 5 vlve 5 t temperture sensor with inr output h,, h 6 sensors of liquid level with inr output FC Ation ulifiers tnk 2 heting h 5 h 6 v 2 h 3 t h 4 p s 2 s 3 h equentil funtion hrt s v Witing for finishing heting the tnk 2 s 7 s 8 Initil step trt s 4 s 5 s 6 v 2 p - lws fulfills ondition v 3 v 4 h h4 v 5 h 6 2 h5 h 3 t Witing for finishing filling up the tnk s n ulifier Desription Vrile Ation Ation 2 2 N Non-stored Terminte when the step eomes intive. et (stored) Continue fter the step is detivted, until the tion is reset. eset Terminte the exeution of n tion previousl strted with the, D, L, or D qulifier. L Time Limited trt when step eomes tive nd ontinue until the step goes intive or set time psses. D Time Deled trt del timer when the step eomes tive. If the step is still tive fter the time del, the tion strts nd ontinues until detivted. P Pulse trt when the step eomes Ative/Detive nd exeute the tion onl one. D tored nd tored nd time Deled Ation strts fter time del, ontinues until reset. Time Deled D Deled If step is still tive, tion strts fter time del, ontinues until reset. L tored tored Time Limited Ation strts when step eomes tive, ontinues for set time or until reset.
20 3 PLC progrmming Lnguge tndrds IEC 3 is n interntionl stndrd for PLCs formulted the Interntionl Eletrotehnil Commission (IEC). As regrds PLC progrmming, it speifies the sntx, semntis nd grphis smols for the following PLC progrmming lnguges: Ldder digrm (LD) equentil Funtion Chrts (FC) Funtion Blok Digrm (FBD) trutured Text (T) Instrution List (IL) Ldder digrms Equivlen etween ldder digrm nd n eletril iruit Ldder ung ung ung 2 End rung Inputs: Contts Left hnd power ril onnetion End Outputs: Coils ight hnd power ril onnetion An eletril equivlent of the rung 24 V - Pressed utton The eletril iruit is losed Btter Power flow Lmp COM North Amerin stle of progrmming, U-tpe of eletril drwing stndrd A rung of the ldder digrm looks like s follows normll open ontt norml output normll losed ontt norml output n lterntive of drwing the norml output The end rung of the ldder digrm hs to e lerl denoted End end rung Internl rels do not exist s rel-world swithing devies ut re onl its in the PLC memor tht ehve in the sme w s rels. To distinguish internl rel outputs from externl rel outputs, the re given different tpes of ddresses. Different mnufturers tend to use different terms for internl rels nd different ws of expressing their ddresses. internl rels
21 Logi Controllers 2 Conventions whih re dopted for drwing ldder digrm The vertil lines of the digrm represent the power rils etween whih iruits re onneted. 2 Eh rung on the ldder defines one opertion in the ontrol proess. 3 A ldder digrm is exeuted from left to right nd from top to ottom. When the PLC is in its run mode, it goes through the entire ldder progrm to the end, the end rung of the progrm eing lerl denoted, nd then promptl resumes t the strt. This proedure of going through ll the rungs of the progrm is lled sn. 4 Eh rung must strt with n input or inputs nd must end with t lest one output. The term input is used for ontrol tion, suh s losing the ontts of swith, used s n input to the PLC. The term output is used for devie onneted to the output of PLC, e.g. motor. 5 Eletril devies re shown in their norml ondition. Thus swith whih is normll open until some ojet loses it, is shown s open on the ldder digrm. A swith tht is normll losed is shown losed. 6 A prtiulr devie n pper in more thn one rung of ldder. For exmple, we might hve rel whih swithes on one or more devies. The sme letters nd/or numers re used to lel the, devie in eh sitution. 7 The inputs nd outputs re ll identified their ddresses, the nottion used depending on the PLC mnufturer. (W. Bolton: Instrumenttion nd ontrol sstems, 24 Elsevier) The ldder digrm for ontrol of the liquid level in the tnk The liquid level ontrol sstem n e desried the ldder digrm. Low level igh level Fill vlve Both the level ontts re normll (ove the level of liquid) losed. Energizing the fill vlve tivtes the ontt designted Fill vlve. Fill vlve Timer In mn ontrol tsks it is neessr to del the onnetion or disonnetion of ontt for speified time intervl. For exmple, motor or pump might need to e ontrolled to operte for prtiulr intervl of time, or e swithed on fter some time intervl. PLCs re equipped uilt-in timers. Timers ount frtions of seonds or seonds using the internl CPU lok. Ldder progrm with del-on timer The Timer s n internl output swithes on the Timer s n internl rel fter del. etivtion of the Timer is ineffiient unless preset del hs not een rehed. Output On Off Time Input Timer Timer Output nning Proess ed Inputs to Input AM Exeute Progrm Dignostis nd Communition tsks Updte Outputs from Output AM epet sn
22 All input Terminls Input Imge Tle Controlled proess Exeute progrm solving the ldder digrm All output Terminls Output Imge Tle Modes of opertion un mode (the proessor egins the snning proess s previousl desried) Progrm mode (the proessor stops snning the ldder progrm nd (tpill) ll the outputs re turned off) Test mode (this mode is identil to the UN mode, exept ll outputs re disled (held in their off stte)) equentil Funtion Chrts nd ldder digrms The Ldder Digrm logi for tpil step tep n- tep n s n- s n Trns p n Previous step tep n- Trns p n tep n One the tep/trnsition logi hs een ompleted then the tions n written to Outputs. In simple sstem outputs n e driven diretl from the sttes tep Output tep 3 tep 5 Trnsition ondition Current step tep n- Previous step
23 Logi Controllers 23 4 Progrmmle Logi Controllers 24V E Progrmle Logi Controller Input inr signls PLC ts s n eletri swithord whih is devie tht direts eletriit from one soure to nother. Output inr signls rels vlves lmps, lights Glvni seprtion of PLC internl iruits nd externl iruits el nd opto-isoltor devies Externl iruits PLC Externl iruits PLC C filter optron PLC Externl iruits LED phototrnsistor mplifier Using rels Using optrons Progrmmle logi ontroller Input unit stem memor Opertionl memor Miroproessor Progrm memor Output unit input output Externl iruits us Allen-Brdle PLC instlled in ontrol pnel PLC IMATIC 7-3 Jiří Tům
Unit 4. Combinational Circuits
Unit 4. Comintionl Ciruits Digitl Eletroni Ciruits (Ciruitos Eletrónios Digitles) E.T.S.I. Informáti Universidd de Sevill 5/10/2012 Jorge Jun 2010, 2011, 2012 You re free to opy, distriute
More informationEngr354: 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 informationExercise 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 informationInstructions. An 8.5 x 11 Cheat Sheet may also be used as an aid for this test. MUST be original handwriting.
ID: B CSE 2021 Computer Orgniztion Midterm Test (Fll 2009) Instrutions This is losed ook, 80 minutes exm. The MIPS referene sheet my e used s n id for this test. An 8.5 x 11 Chet Sheet my lso e used s
More informationCS311 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 informationCARLETON UNIVERSITY. 1.0 Problems and Most Solutions, Sect B, 2005
RLETON UNIVERSIT eprtment of Eletronis ELE 2607 Swithing iruits erury 28, 05; 0 pm.0 Prolems n Most Solutions, Set, 2005 Jn. 2, #8 n #0; Simplify, Prove Prolem. #8 Simplify + + + Reue to four letters (literls).
More informationIntroduction to Electrical & Electronic Engineering ENGG1203
Introduction to Electricl & Electronic Engineering ENGG23 2 nd Semester, 27-8 Dr. Hden Kwok-H So Deprtment of Electricl nd Electronic Engineering Astrction DIGITAL LOGIC 2 Digitl Astrction n Astrct ll
More informationCS 2204 DIGITAL LOGIC & STATE MACHINE DESIGN SPRING 2014
S 224 DIGITAL LOGI & STATE MAHINE DESIGN SPRING 214 DUE : Mrh 27, 214 HOMEWORK III READ : Relte portions of hpters VII n VIII ASSIGNMENT : There re three questions. Solve ll homework n exm prolems s shown
More informationThe 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 informationNON-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 informationProject 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 informationLinear 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 informationCS12N: The Coming Revolution in Computer Architecture Laboratory 2 Preparation
CS2N: The Coming Revolution in Computer Architecture Lortory 2 Preprtion Ojectives:. Understnd the principle of sttic CMOS gte circuits 2. Build simple logic gtes from MOS trnsistors 3. Evlute these gtes
More informationSolutions - Homework 1 (Due date: September 9:30 am) Presentation and clarity are very important!
ECE-238L: Computer Logi Design Fll 23 Solutions - Homework (Due dte: Septemer 2th @ 9:3 m) Presenttion nd lrity re very importnt! PROBLEM (5 PTS) ) Simpliy the ollowing untions using ONLY Boolen Alger
More informationSystem 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 informationTIME 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 information12.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 informationFor a, b, c, d positive if a b and. ac bd. Reciprocal relations for a and b positive. If a > b then a ab > b. then
Slrs-7.2-ADV-.7 Improper Definite Integrls 27.. D.dox Pge of Improper Definite Integrls Before we strt the min topi we present relevnt lger nd it review. See Appendix J for more lger review. Inequlities:
More informationDigital Design IE1204/5
Digitl Design IE4/5 Eerises Compiled y Willim Sndqvist willim@kth.se ICT/ES Eletroni Systems Numer systems nd odes. Enter the orresponding inry numers for the following deiml numers se. 9 7 d 53. Convert
More informationLecture 6. CMOS Static & Dynamic Logic Gates. Static CMOS Circuit. PMOS Transistors in Series/Parallel Connection
NMOS Trnsistors in Series/Prllel onnetion Leture 6 MOS Stti & ynmi Logi Gtes Trnsistors n e thought s swith ontrolled y its gte signl NMOS swith loses when swith ontrol input is high Peter heung eprtment
More informationBoolean algebra.
http://en.wikipedi.org/wiki/elementry_boolen_lger Boolen lger www.tudorgir.com Computer science is not out computers, it is out computtion nd informtion. computtion informtion computer informtion Turing
More informationPropositional models. Historical models of computation. Application: binary addition. Boolean functions. Implementation using switches.
Propositionl models Historil models of omputtion Steven Lindell Hverford College USA 1/22/2010 ISLA 2010 1 Strt with fixed numer of oolen vriles lled the voulry: e.g.,,. Eh oolen vrile represents proposition,
More informationEE 108A Lecture 2 (c) W. J. Dally and P. Levis 2
EE08A Leture 2: Comintionl Logi Design EE 08A Leture 2 () 2005-2008 W. J. Dlly n P. Levis Announements Prof. Levis will hve no offie hours on Friy, Jn 8. Ls n setions hve een ssigne - see the we pge Register
More information1 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 informationChapter 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 informationFinite 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= state, a = reading and q j
4 Finite Automt CHAPTER 2 Finite Automt (FA) (i) Derterministi Finite Automt (DFA) A DFA, M Q, q,, F, Where, Q = set of sttes (finite) q Q = the strt/initil stte = input lphet (finite) (use only those
More informationwhere 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 informationSection 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 informationCombinational Logic. Precedence. Quick Quiz 25/9/12. Schematics à Boolean Expression. 3 Representations of Logic Functions. Dr. Hayden So.
5/9/ Comintionl Logic ENGG05 st Semester, 0 Dr. Hyden So Representtions of Logic Functions Recll tht ny complex logic function cn e expressed in wys: Truth Tle, Boolen Expression, Schemtics Only Truth
More informationApril 8, 2017 Math 9. Geometry. Solving vector problems. Problem. Prove that if vectors and satisfy, then.
pril 8, 2017 Mth 9 Geometry Solving vetor prolems Prolem Prove tht if vetors nd stisfy, then Solution 1 onsider the vetor ddition prllelogrm shown in the Figure Sine its digonls hve equl length,, the prllelogrm
More informationy1 y2 DEMUX a b x1 x2 x3 x4 NETWORK s1 s2 z1 z2
BOOLEAN METHODS Giovnni De Miheli Stnford University Boolen methods Exploit Boolen properties. { Don't re onditions. Minimiztion of the lol funtions. Slower lgorithms, etter qulity results. Externl don't
More informationActivities. 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 informationSIMPLE NONLINEAR GRAPHS
S i m p l e N o n l i n e r G r p h s SIMPLE NONLINEAR GRAPHS www.mthletis.om.u Simple SIMPLE Nonliner NONLINEAR Grphs GRAPHS Liner equtions hve the form = m+ where the power of (n ) is lws. The re lle
More informationPYTHAGORAS 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 informationLogic Synthesis and Verification
Logi Synthesis nd Verifition SOPs nd Inompletely Speified Funtions Jie-Hong Rolnd Jing 江介宏 Deprtment of Eletril Engineering Ntionl Tiwn University Fll 22 Reding: Logi Synthesis in Nutshell Setion 2 most
More informationHybrid Systems Modeling, Analysis and Control
Hyrid Systems Modeling, Anlysis nd Control Rdu Grosu Vienn University of Tehnology Leture 5 Finite Automt s Liner Systems Oservility, Rehility nd More Miniml DFA re Not Miniml NFA (Arnold, Diky nd Nivt
More informationBehavior Composition in the Presence of Failure
Behvior Composition in the Presene of Filure Sestin Srdin RMIT University, Melourne, Austrli Fio Ptrizi & Giuseppe De Giomo Spienz Univ. Rom, Itly KR 08, Sept. 2008, Sydney Austrli Introdution There re
More informationSECTION 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 informationCS 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 information8 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 informationexpression 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 informationNEW CIRCUITS OF HIGH-VOLTAGE PULSE GENERATORS WITH INDUCTIVE-CAPACITIVE ENERGY STORAGE
NEW CIRCUITS OF HIGH-VOLTAGE PULSE GENERATORS WITH INDUCTIVE-CAPACITIVE ENERGY STORAGE V.S. Gordeev, G.A. Myskov Russin Federl Nuler Center All-Russi Sientifi Reserh Institute of Experimentl Physis (RFNC-VNIIEF)
More information6.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 informationChapter 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 informationReference : Croft & Davison, Chapter 12, Blocks 1,2. A matrix ti is a rectangular array or block of numbers usually enclosed in brackets.
I MATRIX ALGEBRA INTRODUCTION TO MATRICES Referene : Croft & Dvison, Chpter, Blos, A mtri ti is retngulr rr or lo of numers usull enlosed in rets. A m n mtri hs m rows nd n olumns. Mtri Alger Pge If the
More information1.3 SCALARS AND VECTORS
Bridge Course Phy I PUC 24 1.3 SCLRS ND VECTORS Introdution: Physis is the study of nturl phenomen. The study of ny nturl phenomenon involves mesurements. For exmple, the distne etween the plnet erth nd
More informationCS 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 informationMaintaining Mathematical Proficiency
Nme Dte hpter 9 Mintining Mthemtil Profiieny Simplify the epression. 1. 500. 189 3. 5 4. 4 3 5. 11 5 6. 8 Solve the proportion. 9 3 14 7. = 8. = 9. 1 7 5 4 = 4 10. 0 6 = 11. 7 4 10 = 1. 5 9 15 3 = 5 +
More informationLogarithms LOGARITHMS.
Logrithms LOGARITHMS www.mthletis.om.u Logrithms LOGARITHMS Logrithms re nother method to lulte nd work with eponents. Answer these questions, efore working through this unit. I used to think: In the
More informationNondeterministic 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 informationLecture 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 informationHardware Verification 2IMF20
Hrdwre Verifition 2IMF20 Julien Shmltz Leture 02: Boolen Funtions, ST, CEC Course ontent - Forml tools Temporl Logis (LTL, CTL) Domin Properties System Verilog ssertions demi & Industrils Proessors Networks
More informationUnit-VII: Linear Algebra-I. To show what are the matrices, why they are useful, how they are classified as various types and how they are solved.
Unit-VII: Liner lger-i Purpose of lession : To show wht re the mtries, wh the re useful, how the re lssified s vrious tpes nd how the re solved. Introdution: Mtries is powerful tool of modern Mthemtis
More informationGM1 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 informationAutomata and Regular Languages
Chpter 9 Automt n Regulr Lnguges 9. Introution This hpter looks t mthemtil moels of omputtion n lnguges tht esrie them. The moel-lnguge reltionship hs multiple levels. We shll explore the simplest level,
More informationI 3 2 = I I 4 = 2A
ECE 210 Eletril Ciruit Anlysis University of llinois t Chigo 2.13 We re ske to use KCL to fin urrents 1 4. The key point in pplying KCL in this prolem is to strt with noe where only one of the urrents
More informationELECTRICAL AND COMPUTER ENGINEERING DEPARTMENT, OAKLAND UNIVERSITY ECE-378: Computer Hardware Design Winter Notes - Unit 1
ELETRIL ND OMPUTER ENGINEERING DEPRTMENT, OKLND UNIVERSIT EE-78: omputer Hrdwre Design Winter 016 INTRODUTION TO LOGI IRUITS Notes - Unit 1 OOLEN LGER This is the oundtion or designing nd nlyzing digitl
More informationUniversity of Sioux Falls. MAT204/205 Calculus I/II
University of Sioux Flls MAT204/205 Clulus I/II Conepts ddressed: Clulus Textook: Thoms Clulus, 11 th ed., Weir, Hss, Giordno 1. Use stndrd differentition nd integrtion tehniques. Differentition tehniques
More information( ) 1. 1) Let f( x ) = 10 5x. Find and simplify f( 2) and then state the domain of f(x).
Mth 15 Fettermn/DeSmet Gustfson/Finl Em Review 1) Let f( ) = 10 5. Find nd simplif f( ) nd then stte the domin of f(). ) Let f( ) = +. Find nd simplif f(1) nd then stte the domin of f(). ) Let f( ) = 8.
More informationLogic Synthesis and Verification
Logi Synthesis nd Verifition SOPs nd Inompletely Speified Funtions Jie-Hong Rolnd Jing 江介宏 Deprtment of Eletril Engineering Ntionl Tiwn University Fll 2010 Reding: Logi Synthesis in Nutshell Setion 2 most
More informationHomework 3 Solutions
CS 341: Foundtions of Computer Science II Prof. Mrvin Nkym Homework 3 Solutions 1. Give NFAs with the specified numer of sttes recognizing ech of the following lnguges. In ll cses, the lphet is Σ = {,1}.
More information21.1 Using Formulae Construct and Use Simple Formulae Revision of Negative Numbers Substitution into Formulae
MEP Jmi: STRAND G UNIT 1 Formule: Student Tet Contents STRAND G: Alger Unit 1 Formule Student Tet Contents Setion 1.1 Using Formule 1. Construt nd Use Simple Formule 1.3 Revision of Negtive Numers 1.4
More informationDiscrete Structures, Test 2 Monday, March 28, 2016 SOLUTIONS, VERSION α
Disrete Strutures, Test 2 Mondy, Mrh 28, 2016 SOLUTIONS, VERSION α α 1. (18 pts) Short nswer. Put your nswer in the ox. No prtil redit. () Consider the reltion R on {,,, d with mtrix digrph of R.. Drw
More informationSymmetrical 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 informationLecture 11 Binary Decision Diagrams (BDDs)
C 474A/57A Computer-Aie Logi Design Leture Binry Deision Digrms (BDDs) C 474/575 Susn Lyseky o 3 Boolen Logi untions Representtions untion n e represente in ierent wys ruth tle, eqution, K-mp, iruit, et
More informationPart 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 informationCh. 2.3 Counting Sample Points. Cardinality of a Set
Ch..3 Counting Smple Points CH 8 Crdinlity of Set Let S e set. If there re extly n distint elements in S, where n is nonnegtive integer, we sy S is finite set nd n is the rdinlity of S. The rdinlity of
More informationAVL Trees. D Oisín Kidney. August 2, 2018
AVL Trees D Oisín Kidne August 2, 2018 Astrt This is verified implementtion of AVL trees in Agd, tking ides primril from Conor MBride s pper How to Keep Your Neighours in Order [2] nd the Agd stndrd lirr
More informationLecture 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] dx (3) = [15x] 2 0
Leture 6. Double Integrls nd Volume on etngle Welome to Cl IV!!!! These notes re designed to be redble nd desribe the w I will eplin the mteril in lss. Hopefull the re thorough, but it s good ide to hve
More informationDiscrete 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 informationTest Generation from Timed Input Output Automata
Chpter 8 Test Genertion from Timed Input Output Automt The purpose of this hpter is to introdue tehniques for the genertion of test dt from models of softwre sed on vrints of timed utomt. The tests generted
More informationENERGY AND PACKING. Outline: MATERIALS AND PACKING. Crystal Structure
EERGY AD PACKIG Outline: Crstlline versus morphous strutures Crstl struture - Unit ell - Coordintion numer - Atomi pking ftor Crstl sstems on dense, rndom pking Dense, regulr pking tpil neighor ond energ
More informationFoundations of Computer Science Comp109
Reding Foundtions o Computer Siene Comp09 University o Liverpool Boris Konev konev@liverpool..uk http://www.s.liv..uk/~konev/comp09 Prt. Funtion Comp09 Foundtions o Computer Siene Disrete Mthemtis nd Its
More informationa) Read over steps (1)- (4) below and sketch the path of the cycle on a P V plot on the graph below. Label all appropriate points.
Prole 3: Crnot Cyle of n Idel Gs In this prole, the strting pressure P nd volue of n idel gs in stte, re given he rtio R = / > of the volues of the sttes nd is given Finlly onstnt γ = 5/3 is given You
More informationPlotting Ordered Pairs Using Integers
SAMPLE Plotting Ordered Pirs Using Integers Ple two elsti nds on geoord to form oordinte xes shown on the right to help you solve these prolems.. Wht letter of the lphet does eh set of pirs nme?. (, )
More informationIntroduction 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 information8.3 THE HYPERBOLA OBJECTIVES
8.3 THE HYPERBOLA OBJECTIVES 1. Define Hperol. Find the Stndrd Form of the Eqution of Hperol 3. Find the Trnsverse Ais 4. Find the Eentriit of Hperol 5. Find the Asmptotes of Hperol 6. Grph Hperol HPERBOLAS
More informationNondeterministic Finite Automata
Nondeterministi Finite utomt The Power of Guessing Tuesdy, Otoer 4, 2 Reding: Sipser.2 (first prt); Stoughton 3.3 3.5 S235 Lnguges nd utomt eprtment of omputer Siene Wellesley ollege Finite utomton (F)
More informationIntegration. antidifferentiation
9 Integrtion 9A Antidifferentition 9B Integrtion of e, sin ( ) nd os ( ) 9C Integrtion reognition 9D Approimting res enlosed funtions 9E The fundmentl theorem of integrl lulus 9F Signed res 9G Further
More informationMathematics SKE: STRAND F. F1.1 Using Formulae. F1.2 Construct and Use Simple Formulae. F1.3 Revision of Negative Numbers
Mthemtis SKE: STRAND F UNIT F1 Formule: Tet STRAND F: Alger F1 Formule Tet Contents Setion F1.1 Using Formule F1. Construt nd Use Simple Formule F1.3 Revision of Negtive Numers F1.4 Sustitution into Formule
More informationTrigonometry Revision Sheet Q5 of Paper 2
Trigonometry Revision Sheet Q of Pper The Bsis - The Trigonometry setion is ll out tringles. We will normlly e given some of the sides or ngles of tringle nd we use formule nd rules to find the others.
More informationBİL 354 Veritabanı Sistemleri. Relational Algebra (İlişkisel Cebir)
BİL 354 Veritnı Sistemleri Reltionl lger (İlişkisel Ceir) Reltionl Queries Query lnguges: llow mnipultion nd retrievl of dt from dtse. Reltionl model supports simple, powerful QLs: Strong forml foundtion
More informationCounting 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 informationELECTRICAL AND COMPUTER ENGINEERING DEPARTMENT, OAKLAND UNIVERSITY ECE-2700: Digital Logic Design Fall Notes - Unit 1
INTRODUTION TO LOGI IRUITS Notes - Unit 1 OOLEN LGER This is the oundtion or designing nd nlyzing digitl systems. It dels with the cse where vriles ssume only one o two vlues: TRUE (usully represented
More informationBisimulation, Games & Hennessy Milner logic
Bisimultion, Gmes & Hennessy Milner logi Leture 1 of Modelli Mtemtii dei Proessi Conorrenti Pweł Soboiński Univeristy of Southmpton, UK Bisimultion, Gmes & Hennessy Milner logi p.1/32 Clssil lnguge theory
More informationA Study on the Properties of Rational Triangles
Interntionl Journl of Mthemtis Reserh. ISSN 0976-5840 Volume 6, Numer (04), pp. 8-9 Interntionl Reserh Pulition House http://www.irphouse.om Study on the Properties of Rtionl Tringles M. Q. lm, M.R. Hssn
More informationArrow 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 informationTOPIC: 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 informationGreen 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 informationBases 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 informationDorf, 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 informationm2 m3 m1 (a) (b) (c) n2 n3
Outline LOGIC SYNTHESIS AND TWO-LEVEL LOGIC OPTIMIZATION Giovnni De Miheli Stnford University Overview of logi synthesis. Comintionl-logi design: { Bkground. { Two-level forms. Ext minimiztion. Covering
More information2.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 informationAssignment 1 Automata, Languages, and Computability. 1 Finite State Automata and Regular Languages
Deprtment of Computer Science, Austrlin Ntionl University COMP2600 Forml Methods for Softwre Engineering Semester 2, 206 Assignment Automt, Lnguges, nd Computility Smple Solutions Finite Stte Automt nd
More informationCS 330 Formal Methods and Models
CS 330 Forml Methods nd Models Dn Richrds, George Mson University, Spring 2017 Quiz Solutions Quiz 1, Propositionl Logic Dte: Ferury 2 1. Prove ((( p q) q) p) is tutology () (3pts) y truth tle. p q p q
More informationThermodynamics. Question 1. Question 2. Question 3 3/10/2010. Practice Questions PV TR PV T R
/10/010 Question 1 1 mole of idel gs is rought to finl stte F y one of three proesses tht hve different initil sttes s shown in the figure. Wht is true for the temperture hnge etween initil nd finl sttes?
More informationHOMEWORK FOR CLASS XII ( )
HOMEWORK FOR CLASS XII 8-9 Show tht the reltion R on the set Z of ll integers defined R,, Z,, is, divisile,, is n equivlene reltion on Z Let f: R R e defined if f if Is f one-one nd onto if If f, g : R
More informationProbability. 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