INF1383 Bancos de Dados


 Ambrose Reed
 2 years ago
 Views:
Transcription
1 3//0 INF383 ncos de Ddos Prof. Sérgio Lifschitz DI PUCRio Eng. Computção, Sistems de Informção e Ciênci d Computção LGER RELCIONL lguns slides sedos ou modificdos dos originis em Elmsri nd Nvthe, Fundmentls of Dtse Systems, 4th Edition 004 Person Eduction, Inc. e Dtse System Concepts, McGrw Hill 5th Edition 005 Silerschtz, Korth nd Sudrshn INF383 D Sérgio Lifschitz Query Lnguges Lnguge in which user requests informtion from the dtse. Ctegories of lnguges Procedurl Nonprocedurl, or declrtive Pure lnguges: Reltionl lger Tuple reltionl clculus Domin reltionl clculus Pure lnguges form underlying sis of query lnguges tht people use. INF383 D Sérgio Lifschitz Slide 56
2 3//0 Reltionl lger The sic set of opertions for the reltionl model is known s the reltionl lger. These opertions enle user to specify sic retrievl requests. The result of retrievl is new reltion, which my hve een formed from one or more reltions. The lger opertions thus produce new reltions, which cn e further mnipulted using opertions of the sme lger. sequence of reltionl lger opertions forms reltionl lger expression, whose result will lso e reltion tht represents the result of dtse query (or retrievl request). INF383 D Sérgio Lifschitz Slide 356 Reltionl lger Procedurl lnguge Five sic opertors select: σ project: union: set difference: Crtesin product: x INF383 D Sérgio Lifschitz Slide 456
3 3//0 Unry Reltionl Opertions SELECT Opertion SELECT opertion is used to select suset of the tuples from reltion tht stisfy selection condition. It is filter tht keeps only those tuples tht stisfy qulifying condition those stisfying the condition re selected while others re discrded. In generl, the select opertion is denoted y σ <selection condition> (R) where the symol σ (sigm) is used to denote the select opertor, nd the selection condition is oolen expression specified on the ttriutes of reltion R INF383 D Sérgio Lifschitz Slide 556 Select Opertion Nottion: σ p (r) p is clled the selection predicte Defined s: σ p (r) = {t t r nd p(t)} Where p is formul in propositionl clculus consisting of terms connected y : (nd), (or), (not) Ech term is one of: <ttriute> op <ttriute> or <constnt> where op is one of: =,, >,. <. INF383 D Sérgio Lifschitz Slide
4 3//0 Select Opertion Exmple C D Reltion r σ = ^ D > 5 (r) C D INF383 D Sérgio Lifschitz Slide 756 SELECT Opertion properties The SELECT opertion σ <selection condition> (R) produces reltion S tht hs the sme schem s R The SELECT opertion σ is commuttive; i.e., σ <condition> (σ < condition> ( R)) = σ <condition> (σ < condition> ( R)) cscded SELECT opertion my e pplied in ny order; i.e., σ <condition> (σ < condition> (σ <condition3> ( R)) = σ <condition> (σ < condition3> (σ < condition> ( R))) cscded SELECT opertion my e replced y single selection with conjunction of ll the conditions; i.e., σ <condition> (σ < condition> (σ <condition3> ( R)) = σ <condition> ND < condition> ND < condition3> ( R))) INF383 D Sérgio Lifschitz Slide
5 3//0 Unry Reltionl Opertions (cont.) PROJECT Opertion This opertion selects certin columns from the tle nd discrds the other columns. The PROJECT cretes verticl prtitioning one with the needed columns (ttriutes) contining results of the opertion nd other contining the discrded Columns. The generl form of the project opertion is π<ttriute list>(r) where π (pi) is the symol used to represent the project opertion nd <ttriute list> is the desired list of ttriutes from the ttriutes of reltion R. The project opertion removes ny duplicte tuples, so the result of the project opertion is set of tuples nd hence vlid reltion. INF383 D Sérgio Lifschitz Slide 956 Nottion: Project Opertion ( r ),, K, k where, re ttriute nmes nd r is reltion nme. The result is defined s the reltion of k columns otined y ersing the columns tht re not listed Duplicte rows removed from result, since reltions re sets INF383 D Sérgio Lifschitz Slide
6 3//0 Project Opertion Exmple Reltion r: C ,C (r) C C = INF383 D Sérgio Lifschitz Slide 56 PROJECT Opertion properties The numer of tuples in the result of projection π <list> (R) is lwys less or equl to the numer of tuples in R. If the list of ttriutes includes key of R, then the numer of tuples is equl to the numer of tuples in R. π <list> (π <list> (R) ) = π <list> (R) s long s <list> contins the ttriutes in <list> INF383 D Sérgio Lifschitz Slide 56 6
7 3//0 Reltionl lger Opertions From Set Theory UNION Opertion The result of this opertion, denoted y R S, is reltion tht includes ll tuples tht re either in R or in S or in oth R nd S. Duplicte tuples re eliminted. The two opernds must e type comptile. Type Comptiility The opernd reltions R (,,..., n ) nd R (,,..., n ) must hve the sme numer of ttriutes, nd the domins of corresponding ttriutes must e comptile; tht is, dom( i )=dom( i ) for i=,,..., n. INF383 D Sérgio Lifschitz Slide 356 Union Opertion Nottion: r s Defined s: r s = {t t r or t s} For r s to e vlid.. r, s must hve the sme rity (sme numer of ttriutes). The ttriute domins must e comptile (sme type of vlues) INF383 D Sérgio Lifschitz Slide
8 3//0 Union Opertion Exmple Reltions r, s: 3 r s r s: 3 INF383 D Sérgio Lifschitz Slide 556 Reltionl lger Opertions From Set Theory (cont.) Set Difference (or MINUS) Opertion The result of this opertion, denoted y R  S, is reltion tht includes ll tuples tht re in R ut not in S. The two opernds must e "type comptile. INF383 D Sérgio Lifschitz Slide
9 3//0 Set Difference Opertion Nottion r s Defined s: r s = {t t r nd t s} Set differences must e tken etween comptile reltions. INF383 D Sérgio Lifschitz Slide 756 Set Difference Opertion Exmple Reltions r, s: 3 r s r s: INF383 D Sérgio Lifschitz Slide
10 3//0 Reltionl lger Opertions From Set Theory (cont.) CRTESIN (or cross product) Opertion This opertion is used to comine tuples from two reltions in comintoril fshion. In generl, the result of R(,,..., n ) x S(,,..., m ) is reltion Q with degree n + m ttriutes Q(,,..., n,,,..., m ), in tht order. The resulting reltion Q hs one tuple for ech comintion of tuples one from R nd one from S. Hence, if R hs n R tuples (denoted s R = n R ), nd S hs n S tuples, then R x S will hve n R * n S tuples. The two opernds do NOT hve to e "type comptile INF383 D Sérgio Lifschitz Slide 956 CrtesinProduct Opertion Nottion r x s Defined s: r x s = {t q t r nd q s} ssume tht ttriutes of r(r) nd s(s) re disjoint. (Tht is, R S = ). If ttriutes of r(r) nd s(s) re not disjoint, then renming must e used. INF383 D Sérgio Lifschitz Slide
11 3//0 CrtesinProduct Opertion Exmple Reltions r, s: C D E r r x s: C D E s INF383 D Sérgio Lifschitz Slide 56 Renming ttriutes ttriute renming: chnge the nme of n ttriute δ (R) chnge to in reltion R Exmple: R(,) δ C (R) R (C,) is renmed to C in R, content is unchnged. INF383 D Sérgio Lifschitz Slide 56
12 3//0 Renming Reltions llows us to nme, nd therefore to refer to, the results of reltionllger expressions. llows us to refer to reltion y more thn one nme. Exmple: ρ x (E) returns the expression E under the nme X If reltionllger expression E hs rity n, then ρ x ( ( E ),,..., n ) returns the result of expression E under the nme X, nd with the ttriutes renmed to,,., n. INF383 D Sérgio Lifschitz Slide 356 ssignment Opertion The ssignment opertion ( ) provides convenient wy to express complex queries. Write query s sequentil progrm consisting of series of ssignments followed y n expression whose vlue is displyed s result of the query. ssignment must lwys e mde to temporry reltion vrile My use vrile in susequent expressions. INF383 D Sérgio Lifschitz Slide 456
13 3//0 Composition of Opertions nd ssignments Expressions using multiple opertions. Exmple: σ =C (r x s) () T r x s () Resp σ =C ( T ) C D E C D E INF383 D Sérgio Lifschitz Slide 556 R Expression: Forml Definition sic expression in reltionl lger (R) consists of either one of the following: reltion in the dtse constnt reltion Let E nd E e reltionllger expressions; the following re ll reltionllger expressions: E E ; E E ; E x E σ p (E ), P is predicte on ttriutes in E s (E ), S is list consisting of some of the ttriutes in E ρ x (E ), x is the new nme for the result of E INF383 D Sérgio Lifschitz Slide
14 3//0 dditionl Opertions dditionl opertions tht do not dd ny power to the reltionl lger, ut my simplify common queries. Set intersection Nturl join Division Generlized Projection ggregte Functions Outer Join INF383 D Sérgio Lifschitz Slide 756 Reltionl lger Opertions From Set Theory (cont.) INTERSECTION OPERTION The result of this opertion, denoted y R S, is reltion tht includes ll tuples tht re in oth R nd S. The two opernds must e "type comptile" INF383 D Sérgio Lifschitz Slide
15 3//0 SetIntersection Opertion Nottion: r s Defined s: r s = { t t r nd t s } ssume: r, s hve the sme rity ttriutes of r nd s re comptile Note: r s = r (r s) INF383 D Sérgio Lifschitz Slide 956 SetIntersection Opertion Exmple Reltion r, s: r r s 3 r s INF383 D Sérgio Lifschitz Slide
16 3//0 Reltionl lger Opertions From Set Theory (cont.) oth union nd intersection re commuttive opertions: R S = S R, nd R S = S R oth union nd intersection cn e treted s nry opertions pplicle to ny numer of reltions s oth re ssocitive: R (S T) = (R S) T, nd (R S) T = R (S T) The minus opertion is not commuttive; tht is, in generl R  S S R INF383 D Sérgio Lifschitz Slide 356 inry Reltionl Opertions JOIN Opertion The sequence of crtesin product followed y select is used quite commonly to identify nd select relted tuples from two reltions It is specil opertion, clled JOIN, denoted y This opertion is very importnt for ny reltionl dtse with more thn single reltion, ecuse it llows us to process reltionships mong reltions. The generl form of join opertion on two reltions R(,,..., n ) nd S(,,..., m ) is: R <join condition>s where R nd S cn e ny reltions tht result from generl reltionl lger expressions. INF383 D Sérgio Lifschitz Slide
17 3//0 inry Reltionl Opertions (cont.) EQUIJOIN Opertion The most common use of join involves join conditions with equlity comprisons only. Such join, where the only comprison opertor used is =, is clled n EQUIJOIN. In the result of n EQUIJOIN we lwys hve one or more pirs of ttriutes (whose nmes need not e identicl) tht hve identicl vlues in every tuple. NTURL JOIN Opertion ecuse one of ech pir of ttriutes with identicl vlues is superfluous, new opertion clled nturl join denoted y * ws creted to get rid of the second (superfluous) ttriute in n EQUIJOIN condition. The stndrd definition of nturl join requires tht the two join ttriutes, or ech pir of corresponding join ttriutes, hve the sme nme in oth reltions. If this is not the cse, renming opertion is pplied first. INF383 D Sérgio Lifschitz Slide NturlJoin Opertion Let r nd s e reltions on schems R nd S respectively. Then, r s is reltion on schem R S otined s follows: Consider ech pir of tuples t r from r nd t s from s. If t r nd t s hve the sme vlue on ech of the ttriutes in R S, dd tuple t to the result, where t hs the sme vlue s t r on r t hs the sme vlue s t s on s Exmple: R = (,, 3, 4) e S = (,, 4) Result schem = (,, 3, 4, ) r s is defined s: r., r., r.3, r.4, s. (σ r. = s. r.4 = s.4 (r x s)) INF383 D Sérgio Lifschitz Slide
18 3//0 8 INF383 D Sérgio Lifschitz Slide Nturl Join Opertion Exmple Reltions r, s: δ 4 C D 3 3 D E δ r δ C D E δ s r s INF383 D Sérgio Lifschitz Slide Complete Set of Reltionl Opertions The set of opertions including select σ, project π, union, set difference , nd crtesin product X is clled complete set ecuse ny other reltionl lger expression cn e expressed y comintion of these five opertions. For exmple: R <join condition> S = σ <join condition> (R X S)
19 3//0 inry Reltionl Opertions (cont.) DIVISION Opertion The division opertion is pplied to two reltions R(Z) S(X), where X suset Z. Let Y = Z  X (nd hence Z = X Y); tht is, let Y e the set of ttriutes of R tht re not ttriutes of S. The result of DIVISION is reltion T(Y) tht includes tuple t if tuples t R pper in R with t R [Y] = t, nd with t R [X] = t s for every tuple t s in S. For tuple t to pper in the result T of the DIVISION, the vlues in t must pper in R in comintion with every tuple in S. INF383 D Sérgio Lifschitz Slide Division Opertion Exmple Reltions r, s: δ δ δ r s: INF383 D Sérgio Lifschitz Slide
20 3//0 Division Opertion Suited to queries tht include the phrse for ll. r s Let r nd s e reltions on schems R nd S respectively where R = (,, m,,, n ) S = (,, n ) The result of r s is reltion on schem R S = (,, m ) r s = { t t RS (r) u s ( tu r ) } Where tu mens the conctention of tuples t nd u to produce single tuple INF383 D Sérgio Lifschitz Slide nother Division Exmple Reltions r, s: C D E D E r 3 s r s: C INF383 D Sérgio Lifschitz Slide
21 3//0 Property Division Opertion (Cont.) Let q = r s Then q is the lrgest reltion stisfying q x s r Definition in terms of the sic lger opertion Let r(r) nd s(s) e reltions, nd let S R To see why r s = RS (r ) RS ( ( RS (r ) x s ) RS,S (r )) RS,S (r) simply reorders ttriutes of r RS ( RS (r ) x s ) RS,S (r) ) gives those tuples t in RS (r ) such tht for some tuple u s, tu r. INF383 D Sérgio Lifschitz Slide 456 Generlized Projection Extends the projection opertion y llowing rithmetic functions to e used in the projection list. F E is ny reltionllger expression, F,..., F n ( E) Ech of F, F,, F n re re rithmetic expressions involving constnts nd ttriutes in the schem of E. INF383 D Sérgio Lifschitz Slide 456
22 3//0 dditionl Reltionl Opertions ggregte Functions nd Grouping type of request tht cnnot e expressed in the sic reltionl lger is to specify mthemticl ggregte functions on collections of vlues from the dtse. Exmples of such functions include retrieving the verge or totl slry of ll employees or the totl numer of employee tuples. These functions re used in simple sttisticl queries tht summrize informtion from the dtse tuples. Common functions pplied to collections of numeric vlues include SUM, VERGE, MXIMUM, nd MINIMUM. The COUNT function is used for counting tuples or vlues. INF383 D Sérgio Lifschitz Slide ggregte Functions nd Opertions ggregtion function tkes collection of vlues nd returns single vlue s result. vg: verge vlue min: minimum vlue mx: mximum vlue sum: sum of vlues count: numer of vlues ggregte opertion in reltionl lger ϑ ) ( E G, G, K, Gn F ( ), F (, K, Fn ( n ) E is ny reltionllger expression G, G, G n is list of ttriutes on which to group (cn e empty) Ech F i is n ggregte function Ech i is n ttriute nme INF383 D Sérgio Lifschitz Slide 4456
23 3//0 ggregte Opertion nd Generlized Projection  exmples Reltion r: g sum(cc) (r) CC CP , (CC CP) (r) CC  CP 5 sum(cc ) INF383 D Sérgio Lifschitz Slide nking Dtse Exmple rnch (rnch_nme, rnch_city, ssets) customer (customer_nme, customer_street, customer_city) ccount (ccount_numer, rnch_nme, lnce) lon (lon_numer, rnch_nme, mount) depositor (customer_nme, ccount_numer) orrower (customer_nme, lon_numer) INF383 D Sérgio Lifschitz Slide
24 3//0 ggregte Opertion Exmple Reltion ccount grouped y rnchnme: rnch_nme ccount_numer lnce Perryridge Perryridge righton righton Redwood rnch_nme g sum(lnce) (ccount) rnch_nme Perryridge righton Redwood sum(lnce) INF383 D Sérgio Lifschitz Slide ggregte Functions (Cont.) Result of ggregtion does not hve nme Cn use renme opertion to give it nme For convenience, we permit renming s prt of ggregte opertion rnch_nme g sum(lnce) s sum_lnce (ccount) INF383 D Sérgio Lifschitz Slide
25 3//0 Null Vlues It is possile for tuples to hve null vlue, denoted y null, for some of their ttriutes null signifies n unknown vlue or tht vlue does not exist. The result of ny rithmetic expression involving null is null. ggregte functions simply ignore null vlues (s in SQL) For duplicte elimintion nd grouping, null is treted like ny other vlue nd two nulls re ssumed to e the sme (s in SQL) INF383 D Sérgio Lifschitz Slide Null Vlues (cont.) Comprisons with null vlues return the specil truth vlue: unknown If flse ws used insted of unknown, then not ( < 5) would not e equivlent to >= 5 Threevlued logic using the truth vlue unknown: OR: (unknown or true) = true, (unknown or flse) = unknown (unknown or unknown) = unknown ND: (true nd unknown) = unknown, (flse nd unknown) = flse, (unknown nd unknown) = unknown NOT: (not unknown) = unknown Result of select predicte is treted s flse if it evlutes to unknown INF383 D Sérgio Lifschitz Slide
26 3//0 dditionl Reltionl Opertions (cont.) The OUTER JOIN Opertion In NTURL JOIN tuples without mtching (or relted) tuple re eliminted from the join result. Tuples with null in the join ttriutes re lso eliminted. This mounts to loss of informtion. set of opertions, clled outer joins, cn e used when we wnt to keep ll the tuples in R, or ll those in S, or ll those in oth reltions in the result of the join, regrdless of whether or not they hve mtching tuples in the other reltion. INF383 D Sérgio Lifschitz Slide 556 dditionl Reltionl Opertions (cont.) Types of OUTER JOIN The left outer join opertion keeps every tuple in the first or left reltion R in R S; if no mtching tuple is found in S, then the ttriutes of S in the join result re filled or pdded with null vlues. similr opertion, right outer join, keeps every tuple in the second or right reltion S in the result of R S. third opertion, full outer join, denoted y keeps ll tuples in oth the left nd the right reltions when no mtching tuples re found, pdding them with null vlues s needed. INF383 D Sérgio Lifschitz Slide
27 3//0 Outer Join nking D Exmple (/4) Reltion lon lon_numer L70 L30 L60 rnch_nme Downtown Redwood Perryridge mount Reltion orrower customer_nme lon_numer Jones Smith Hyes L70 L30 L55 INF383 D Sérgio Lifschitz Slide Outer Join Exmple (/4) FIRST: recll the inner Join (nturl join) lon orrower lon_numer rnch_nme mount customer_nme L70 L30 Downtown Redwood Jones Smith INF383 D Sérgio Lifschitz Slide
28 3//0 Outer Join Exmple (3/4) Left Outer Join lon orrower lon_numer rnch_nme mount customer_nme L70 L30 L60 Downtown Redwood Perryridge Jones Smith null Right Outer Join lon orrower lon_numer rnch_nme mount customer_nme L70 L30 L55 Downtown Redwood null null Jones Smith Hyes INF383 D Sérgio Lifschitz Slide Outer Join Exmple (4/4) Full Outer Join lon orrower lon_numer rnch_nme mount customer_nme L70 L30 L60 L55 Downtown Redwood Perryridge null null Jones Smith null Hyes INF383 D Sérgio Lifschitz Slide
Bİ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 informationDATABASE DESIGN I  1DL300
DATABASE DESIGN I  DL300 Fll 00 An introductory course on dtse systems http://www.it.uu.se/edu/course/homepge/dstekn/ht0/ Mnivskn Sesn Uppsl Dtse Lortory Deprtment of Informtion Technology, Uppsl University,
More informationDATABASTEKNIK  1DL116
DATABASTEKNIK  DL6 Spring 004 An introductury course on dtse systems http://user.it.uu.se/~udl/dtvt004/ Kjell Orsorn Uppsl Dtse Lortory Deprtment of Informtion Technology, Uppsl University, Uppsl, Sweden
More informationRELATIONAL MODEL.
RELATIONAL MODEL Structure of Reltionl Dtbses Reltionl Algebr Tuple Reltionl Clculus Domin Reltionl Clculus Extended ReltionlAlgebr Opertions Modifiction of the Dtbse Views EXAMPLE OF A RELATION BASIC
More informationLearning Goals. Relational Query Languages. Formal Relational Query Languages. Formal Query Languages: Relational Algebra and Relational Calculus
Forml Query Lnguges: Reltionl Alger nd Reltionl Clculus Chpter 4 Lerning Gols Given dtse ( set of tles ) you will e le to express dtse query in Reltionl Alger (RA), involving the sic opertors (selection,
More informationReasoning and programming. Lecture 5: Invariants and Logic. Boolean expressions. Reasoning. Examples
Chir of Softwre Engineering Resoning nd progrmming Einführung in die Progrmmierung Introduction to Progrmming Prof. Dr. Bertrnd Meyer Octoer 2006 Ferury 2007 Lecture 5: Invrints nd Logic Logic is the sis
More informationBoolean Algebra. Boolean Algebra
Boolen Alger Boolen Alger A Boolen lger is set B of vlues together with:  two inry opertions, commonly denoted y + nd,  unry opertion, usully denoted y ˉ or ~ or,  two elements usully clled zero nd
More informationMinimal DFA. minimal DFA for L starting from any other
Miniml DFA Among the mny DFAs ccepting the sme regulr lnguge L, there is exctly one (up to renming of sttes) which hs the smllest possile numer of sttes. Moreover, it is possile to otin tht miniml DFA
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 informationParse 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 contextfree grmmrs
More informationIntermediate 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 informationCS 330 Formal Methods and Models Dana Richards, George Mason University, Spring 2016 Quiz Solutions
CS 330 Forml Methods nd Models Dn Richrds, George Mson University, Spring 2016 Quiz Solutions Quiz 1, Propositionl Logic Dte: Ferury 9 1. (4pts) ((p q) (q r)) (p r), prove tutology using truth tles. p
More informationCoalgebra, Lecture 15: Equations for Deterministic Automata
Colger, Lecture 15: Equtions for Deterministic Automt Julin Slmnc (nd Jurrin Rot) Decemer 19, 2016 In this lecture, we will study the concept of equtions for deterministic utomt. The notes re self contined
More informationOverview of Today s Lecture:
CPS 4 Computer Orgniztion nd Progrmming Lecture : Boolen Alger & gtes. Roert Wgner CPS4 BA. RW Fll 2 Overview of Tody s Lecture: Truth tles, Boolen functions, Gtes nd Circuits Krnugh mps for simplifying
More informationLecture 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 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 informationSymbolic enumeration methods for unlabelled structures
Go & Šjn, Comintoril Enumertion Notes 4 Symolic enumertion methods for unlelled structures Definition A comintoril clss is finite or denumerle set on which size function is defined, stisfying the following
More informationLecture 3 ( ) (translated and slightly adapted from lecture notes by Martin Klazar)
Lecture 3 (5.3.2018) (trnslted nd slightly dpted from lecture notes by Mrtin Klzr) Riemnn integrl Now we define precisely the concept of the re, in prticulr, the re of figure U(, b, f) under the grph of
More informationConvert the NFA into DFA
Convert the NF into F For ech NF we cn find F ccepting the sme lnguge. The numer of sttes of the F could e exponentil in the numer of sttes of the NF, ut in prctice this worst cse occurs rrely. lgorithm:
More informationAUTOMATA AND LANGUAGES. Definition 1.5: Finite Automaton
25. Finite Automt AUTOMATA AND LANGUAGES A system of computtion tht only hs finite numer of possile sttes cn e modeled using finite utomton A finite utomton is often illustrted s stte digrm d d d. d q
More informationNondeterminism and Nodeterministic Automata
Nondeterminism nd Nodeterministic Automt 61 Nondeterminism nd Nondeterministic Automt The computtionl mchine models tht we lerned in the clss re deterministic in the sense tht the next move is uniquely
More informationMatrix Algebra. Matrix Addition, Scalar Multiplication and Transposition. Linear Algebra I 24
Mtrix lger Mtrix ddition, Sclr Multipliction nd rnsposition Mtrix lger Section.. Mtrix ddition, Sclr Multipliction nd rnsposition rectngulr rry of numers is clled mtrix ( the plurl is mtrices ) nd the
More informationSeptember 13 Homework Solutions
College of Engineering nd Computer Science Mechnicl Engineering Deprtment Mechnicl Engineering 5A Seminr in Engineering Anlysis Fll Ticket: 5966 Instructor: Lrry Cretto Septemer Homework Solutions. Are
More informationHandout: Natural deduction for first order logic
MATH 457 Introduction to Mthemticl Logic Spring 2016 Dr Json Rute Hndout: Nturl deduction for first order logic We will extend our nturl deduction rules for sententil logic to first order logic These notes
More informationDesigning finite automata II
Designing finite utomt II Prolem: Design DFA A such tht L(A) consists of ll strings of nd which re of length 3n, for n = 0, 1, 2, (1) Determine wht to rememer out the input string Assign stte to ech of
More informationBridging the gap: GCSE AS Level
Bridging the gp: GCSE AS Level CONTENTS Chpter Removing rckets pge Chpter Liner equtions Chpter Simultneous equtions 8 Chpter Fctors 0 Chpter Chnge the suject of the formul Chpter 6 Solving qudrtic equtions
More informationChapter 6 Techniques of Integration
MA Techniques of Integrtion Asst.Prof.Dr.Suprnee Liswdi Chpter 6 Techniques of Integrtion Recll: Some importnt integrls tht we hve lernt so fr. Tle of Integrls n+ n d = + C n + e d = e + C ( n ) d = ln
More informationClosure Properties of Regular Languages
Closure Properties of Regulr Lnguges Regulr lnguges re closed under mny set opertions. Let L 1 nd L 2 e regulr lnguges. (1) L 1 L 2 (the union) is regulr. (2) L 1 L 2 (the conctention) is regulr. (3) L
More informationBases for Vector Spaces
Bses for Vector Spces 22625 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 informationChapter Five: Nondeterministic Finite Automata. Formal Language, chapter 5, slide 1
Chpter Five: Nondeterministic Finite Automt Forml Lnguge, chpter 5, slide 1 1 A DFA hs exctly one trnsition from every stte on every symol in the lphet. By relxing this requirement we get relted ut more
More informationFinite Automata Theory and Formal Languages TMV027/DIT321 LP4 2018
Finite Automt Theory nd Forml Lnguges TMV027/DIT321 LP4 2018 Lecture 10 An Bove April 23rd 2018 Recp: Regulr Lnguges We cn convert between FA nd RE; Hence both FA nd RE ccept/generte regulr lnguges; More
More information1B40 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 informationLecture 08: Feb. 08, 2019
4CS46: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 informationHarvard University Computer Science 121 Midterm October 23, 2012
Hrvrd University Computer Science 121 Midterm Octoer 23, 2012 This is closedook exmintion. You my use ny result from lecture, Sipser, prolem sets, or section, s long s you quote it clerly. The lphet is
More informationpadic Egyptian Fractions
padic Egyptin Frctions Contents 1 Introduction 1 2 Trditionl Egyptin Frctions nd Greedy Algorithm 2 3 Setup 3 4 pgreedy Algorithm 5 5 pegyptin Trditionl 10 6 Conclusion 1 Introduction An Egyptin frction
More informationCM10196 Topic 4: Functions and Relations
CM096 Topic 4: Functions nd Reltions Guy McCusker W. Functions nd reltions Perhps the most widely used notion in ll of mthemtics is tht of function. Informlly, function is n opertion which tkes n input
More informationUNIT 5 QUADRATIC FUNCTIONS Lesson 3: Creating Quadratic Equations in Two or More Variables Instruction
Lesson 3: Creting Qudrtic Equtions in Two or More Vriles Prerequisite Skills This lesson requires the use of the following skill: solving equtions with degree of Introduction 1 The formul for finding the
More informationTypes of Finite Automata. CMSC 330: Organization of Programming Languages. Comparing DFAs and NFAs. Comparing DFAs and NFAs (cont.) Finite Automata 2
CMSC 330: Orgniztion of Progrmming Lnguges Finite Automt 2 Types of Finite Automt Deterministic Finite Automt () Exctly one sequence of steps for ech string All exmples so fr Nondeterministic Finite Automt
More informationVectors , (0,0). 5. A vector is commonly denoted by putting an arrow above its symbol, as in the picture above. Here are some 3dimensional vectors:
Vectors 1232018 I ll look t vectors from n lgeric point of view nd geometric point of view. Algericlly, vector is n ordered list of (usully) rel numers. Here re some 2dimensionl vectors: (2, 3), ( )
More informationI1 = 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 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 informationFinite Automatacont d
Automt Theory nd Forml Lnguges Professor Leslie Lnder Lecture # 6 Finite Automtcont d The Pumping Lemm WEB SITE: http://ingwe.inghmton.edu/ ~lnder/cs573.html Septemer 18, 2000 Exmple 1 Consider L = {ww
More informationBernoulli Numbers Jeff Morton
Bernoulli Numbers Jeff Morton. We re interested in the opertor e t k d k t k, which is to sy k tk. Applying this to some function f E to get e t f d k k tk d k f f + d k k tk dk f, we note tht since f
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 informationCMSC 330: Organization of Programming Languages
CMSC 330: Orgniztion of Progrmming Lnguges Finite Automt 2 CMSC 330 1 Types of Finite Automt Deterministic Finite Automt (DFA) Exctly one sequence of steps for ech string All exmples so fr Nondeterministic
More informationThe area under the graph of f and above the xaxis between a and b is denoted by. f(x) dx. π O
1 Section 5. The Definite Integrl Suppose tht function f is continuous nd positive over n intervl [, ]. y = f(x) x The re under the grph of f nd ove the xxis etween nd is denoted y f(x) dx nd clled the
More information378 Relations Solutions for Chapter 16. Section 16.1 Exercises. 3. Let A = {0,1,2,3,4,5}. Write out the relation R that expresses on A.
378 Reltions 16.7 Solutions for Chpter 16 Section 16.1 Exercises 1. Let A = {0,1,2,3,4,5}. Write out the reltion R tht expresses > on A. Then illustrte it with digrm. 2 1 R = { (5,4),(5,3),(5,2),(5,1),(5,0),(4,3),(4,2),(4,1),
More informationAdvanced Calculus: MATH 410 Notes on Integrals and Integrability Professor David Levermore 17 October 2004
Advnced Clculus: MATH 410 Notes on Integrls nd Integrbility Professor Dvid Levermore 17 October 2004 1. Definite Integrls In this section we revisit the definite integrl tht you were introduced to when
More information1. For each of the following theorems, give a two or three sentence sketch of how the proof goes or why it is not true.
York University CSE 2 Unit 3. DFA Clsses Converting etween DFA, NFA, Regulr Expressions, nd Extended Regulr Expressions Instructor: Jeff Edmonds Don t chet y looking t these nswers premturely.. For ech
More informationNFAs and Regular Expressions. NFAε, continued. Recall. Last class: Today: Fun:
CMPU 240 Lnguge Theory nd Computtion Spring 2019 NFAs nd Regulr Expressions Lst clss: Introduced nondeterministic finite utomt with trnsitions Tody: Prove n NFA is no more powerful thn n NFA Introduce
More informationTypes of Finite Automata. CMSC 330: Organization of Programming Languages. Comparing DFAs and NFAs. NFA for (a b)*abb.
CMSC 330: Orgniztion of Progrmming Lnguges Finite Automt 2 Types of Finite Automt Deterministic Finite Automt () Exctly one sequence of steps for ech string All exmples so fr Nondeterministic Finite Automt
More informationFirst Midterm Examination
2425 Fll Semester First Midterm Exmintion ) Give the stte digrm of DFA tht recognizes the lnguge A over lphet Σ = {, } where A = {w w contins or } 2) The following DFA recognizes the lnguge B over lphet
More informationLinear Inequalities. Work Sheet 1
Work Sheet 1 Liner Inequlities RentHep, cr rentl compny,chrges $ 15 per week plus $ 0.0 per mile to rent one of their crs. Suppose you re limited y how much money you cn spend for the week : You cn spend
More informationIntroduction to Group Theory
Introduction to Group Theory Let G be n rbitrry set of elements, typiclly denoted s, b, c,, tht is, let G = {, b, c, }. A binry opertion in G is rule tht ssocites with ech ordered pir (,b) of elements
More information8. Complex Numbers. We can combine the real numbers with this new imaginary number to form the complex numbers.
8. Complex Numers The rel numer system is dequte for solving mny mthemticl prolems. But it is necessry to extend the rel numer system to solve numer of importnt prolems. Complex numers do not chnge the
More informationCSE : Exam 3ANSWERS, Spring 2011 Time: 50 minutes
CSE 260002: Exm 3ANSWERS, Spring 20 ime: 50 minutes Nme: his exm hs 4 pges nd 0 prolems totling 00 points. his exm is closed ook nd closed notes.. Wrshll s lgorithm for trnsitive closure computtion is
More informationFundamental Theorem of Calculus
Fundmentl Theorem of Clculus Recll tht if f is nonnegtive nd continuous on [, ], then the re under its grph etween nd is the definite integrl A= f() d Now, for in the intervl [, ], let A() e the re under
More informationReview of Calculus, cont d
Jim Lmbers MAT 460 Fll Semester 200910 Lecture 3 Notes These notes correspond to Section 1.1 in the text. Review of Clculus, cont d Riemnn Sums nd the Definite Integrl There re mny cses in which some
More informationDEFINITION 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 informationProperties 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 informationMA123, Chapter 10: Formulas for integrals: integrals, antiderivatives, and the Fundamental Theorem of Calculus (pp.
MA123, Chpter 1: Formuls for integrls: integrls, ntiderivtives, nd the Fundmentl Theorem of Clculus (pp. 27233, Gootmn) Chpter Gols: Assignments: Understnd the sttement of the Fundmentl Theorem of Clculus.
More informationCHAPTER 1 Regular Languages. Contents
Finite Automt (FA or DFA) CHAPTE 1 egulr Lnguges Contents definitions, exmples, designing, regulr opertions Nondeterministic Finite Automt (NFA) definitions, euivlence of NFAs nd DFAs, closure under regulr
More informationRiemann Sums and Riemann Integrals
Riemnn Sums nd Riemnn Integrls Jmes K. Peterson Deprtment of Biologicl Sciences nd Deprtment of Mthemticl Sciences Clemson University August 26, 203 Outline Riemnn Sums Riemnn Integrls Properties Abstrct
More informationBoolean Algebra. Boolean Algebras
Boolen Algebr Boolen Algebrs A Boolen lgebr is set B of vlues together with:  two binry opertions, commonly denoted by + nd,  unry opertion, usully denoted by or ~ or,  two elements usully clled zero
More informationHomework 4. 0 ε 0. (00) ε 0 ε 0 (00) (11) CS 341: Foundations of Computer Science II Prof. Marvin Nakayama
CS 341: Foundtions of Computer Science II Prof. Mrvin Nkym Homework 4 1. UsetheproceduredescriedinLemm1.55toconverttheregulrexpression(((00) (11)) 01) into n NFA. Answer: 0 0 1 1 00 0 0 11 1 1 01 0 1 (00)
More informationAPPENDIX. Precalculus Review D.1. Real Numbers and the Real Number Line
APPENDIX D Preclculus Review APPENDIX D.1 Rel Numers n the Rel Numer Line Rel Numers n the Rel Numer Line Orer n Inequlities Asolute Vlue n Distnce Rel Numers n the Rel Numer Line Rel numers cn e represente
More informationThings to Memorize: A Partial List. January 27, 2017
Things to Memorize: A Prtil List Jnury 27, 2017 Chpter 2 Vectors  Bsic Fcts A vector hs mgnitude (lso clled size/length/norm) nd direction. It does not hve fixed position, so the sme vector cn e moved
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 informationFachgebiet Rechnersysteme1. 1. Boolean Algebra. 1. Boolean Algebra. Verification Technology. Content. 1.1 Boolean algebra basics (recap)
. Boolen Alger Fchgeiet Rechnersysteme. Boolen Alger Veriiction Technology Content. Boolen lger sics (recp).2 Resoning out Boolen expressions . Boolen Alger 2 The prolem o logic veriiction: Show tht two
More informationRiemann Sums and Riemann Integrals
Riemnn Sums nd Riemnn Integrls Jmes K. Peterson Deprtment of Biologicl Sciences nd Deprtment of Mthemticl Sciences Clemson University August 26, 2013 Outline 1 Riemnn Sums 2 Riemnn Integrls 3 Properties
More informationThe Regulated and Riemann Integrals
Chpter 1 The Regulted nd Riemnn Integrls 1.1 Introduction We will consider severl different pproches to defining the definite integrl f(x) dx of function f(x). These definitions will ll ssign the sme vlue
More informationLecture Solution of a System of Linear Equation
ChE Lecture Notes, Dept. of Chemicl Engineering, Univ. of TN, Knoville  D. Keffer, 5/9/98 (updted /) Lecture 8  Solution of System of Liner Eqution 8. Why is it importnt to e le to solve system of liner
More informationChapters Five Notes SN AA U1C5
Chpters Five Notes SN AA U1C5 Nme Period Section 5: Fctoring Qudrtic Epressions When you took lger, you lerned tht the first thing involved in fctoring is to mke sure to fctor out ny numers or vriles
More informationEhrenfeuchtFraïssé Games: Applications and Complexity. Department of Mathematics and Computer Science University of Udine, Italy ESSLLI 2010 CPH
EhrenfeuchtFrïssé Gmes: Applictions nd Complexity Angelo Montnri Nicol Vitcolonn Deprtment of Mthemtics nd Computer Science University of Udine, Itly ESSLLI 2010 CPH Outline Introduction to EFgmes Inexpressivity
More informationBefore we can begin Ch. 3 on Radicals, we need to be familiar with perfect squares, cubes, etc. Try and do as many as you can without a calculator!!!
Nme: Algebr II Honors PreChpter Homework Before we cn begin Ch on Rdicls, we need to be fmilir with perfect squres, cubes, etc Try nd do s mny s you cn without clcultor!!! n The nth root of n n Be ble
More informationFABER Formal Languages, Automata and Models of Computation
DVA337 FABER Forml Lnguges, Automt nd Models of Computtion Lecture 5 chool of Innovtion, Design nd Engineering Mälrdlen University 2015 1 Recp of lecture 4 y definition suset construction DFA NFA stte
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 informationCS 310 (sec 20)  Winter Final Exam (solutions) SOLUTIONS
CS 310 (sec 20)  Winter 2003  Finl Exm (solutions) SOLUTIONS 1. (Logic) Use truth tles to prove the following logicl equivlences: () p q (p p) (q q) () p q (p q) (p q) () p q p q p p q q (q q) (p p)
More informationChapter 2 Finite Automata
Chpter 2 Finite Automt 28 2.1 Introduction Finite utomt: first model of the notion of effective procedure. (They lso hve mny other pplictions). The concept of finite utomton cn e derived y exmining wht
More informationFarey Fractions. Rickard Fernström. U.U.D.M. Project Report 2017:24. Department of Mathematics Uppsala University
U.U.D.M. Project Report 07:4 Frey Frctions Rickrd Fernström Exmensrete i mtemtik, 5 hp Hledre: Andres Strömergsson Exmintor: Jörgen Östensson Juni 07 Deprtment of Mthemtics Uppsl University Frey Frctions
More informationIntroduction to Electrical & Electronic Engineering ENGG1203
Introduction to Electricl & Electronic Engineering ENGG23 2 nd Semester, 278 Dr. Hden KwokH So Deprtment of Electricl nd Electronic Engineering Astrction DIGITAL LOGIC 2 Digitl Astrction n Astrct ll
More informationThe University of Nottingham SCHOOL OF COMPUTER SCIENCE A LEVEL 2 MODULE, SPRING SEMESTER LANGUAGES AND COMPUTATION ANSWERS
The University of Nottinghm SCHOOL OF COMPUTER SCIENCE LEVEL 2 MODULE, SPRING SEMESTER 2016 2017 LNGUGES ND COMPUTTION NSWERS Time llowed TWO hours Cndidtes my complete the front cover of their nswer ook
More informationHow 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 informationCS 330 Formal Methods and Models
CS 0 Forml Methods nd Models Dn Richrds, George Mson University, Fll 2016 Quiz Solutions Quiz 1, Propositionl Logic Dte: Septemer 8 1. Prove q (q p) p q p () (4pts) with truth tle. p q p q p (q p) p q
More informationW. We shall do so one by one, starting with I 1, and we shall do it greedily, trying
Vitli covers 1 Definition. A Vitli cover of set E R is set V of closed intervls with positive length so tht, for every δ > 0 nd every x E, there is some I V with λ(i ) < δ nd x I. 2 Lemm (Vitli covering)
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 informationand that at t = 0 the object is at position 5. Find the position of the object at t = 2.
7.2 The Fundmentl Theorem of Clculus 49 re mny, mny problems tht pper much different on the surfce but tht turn out to be the sme s these problems, in the sense tht when we try to pproimte solutions we
More informationDesigning Information Devices and Systems I Discussion 8B
Lst Updted: 20181017 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 informationRiemann Integrals and the Fundamental Theorem of Calculus
Riemnn Integrls nd the Fundmentl Theorem of Clculus Jmes K. Peterson Deprtment of Biologicl Sciences nd Deprtment of Mthemticl Sciences Clemson University September 16, 2013 Outline Grphing Riemnn Sums
More informationLecture 3: Curves in Calculus. Table of contents
Mth 348 Fll 7 Lecture 3: Curves in Clculus Disclimer. As we hve textook, this lecture note is for guidnce nd supplement only. It should not e relied on when prepring for exms. In this lecture we set up
More informationCMPSCI 250: Introduction to Computation. Lecture #31: What DFA s Can and Can t Do David Mix Barrington 9 April 2014
CMPSCI 250: Introduction to Computtion Lecture #31: Wht DFA s Cn nd Cn t Do Dvid Mix Brrington 9 April 2014 Wht DFA s Cn nd Cn t Do Deterministic Finite Automt Forml Definition of DFA s Exmples of DFA
More information7. Indefinite Integrals
7. Indefinite Integrls These lecture notes present my interprettion of Ruth Lwrence s lecture notes (in Herew) 7. Prolem sttement By the fundmentl theorem of clculus, to clculte n integrl we need to find
More informationPreSession Review. Part 1: Basic Algebra; Linear Functions and Graphs
PreSession Review Prt 1: Bsic Algebr; Liner Functions nd Grphs A. Generl Review nd Introduction to Algebr Hierrchy of Arithmetic Opertions Opertions in ny expression re performed in the following order:
More informationset is not closed under matrix [ multiplication, ] and does not form a group.
Prolem 2.3: Which of the following collections of 2 2 mtrices with rel entries form groups under [ mtrix ] multipliction? i) Those of the form for which c d 2 Answer: The set of such mtrices is not closed
More informationChapter 3 Single Random Variables and Probability Distributions (Part 2)
Chpter 3 Single Rndom Vriles nd Proilit Distriutions (Prt ) Contents Wht is Rndom Vrile? Proilit Distriution Functions Cumultive Distriution Function Proilit Densit Function Common Rndom Vriles nd their
More information1.4 Nonregular Languages
74 1.4 Nonregulr Lnguges The number of forml lnguges over ny lphbet (= decision/recognition problems) is uncountble On the other hnd, the number of regulr expressions (= strings) is countble Hence, ll
More informationLecture 2: January 27
CS 684: Algorithmic Gme Theory Spring 217 Lecturer: Év Trdos Lecture 2: Jnury 27 Scrie: Alert Julius Liu 2.1 Logistics Scrie notes must e sumitted within 24 hours of the corresponding lecture for full
More informationName Ima Sample ASU ID
Nme Im Smple ASU ID 2468024680 CSE 355 Test 1, Fll 2016 30 Septemer 2016, 8:359:25.m., LSA 191 Regrding of Midterms If you elieve tht your grde hs not een dded up correctly, return the entire pper to
More informationINTRODUCTION TO LINEAR ALGEBRA
ME Applied Mthemtics for Mechnicl Engineers INTRODUCTION TO INEAR AGEBRA Mtrices nd Vectors Prof. Dr. Bülent E. Pltin Spring Sections & / ME Applied Mthemtics for Mechnicl Engineers INTRODUCTION TO INEAR
More informationContextFree Grammars and Languages
ContextFree Grmmrs nd Lnguges (Bsed on Hopcroft, Motwni nd Ullmn (2007) & Cohen (1997)) Introduction Consider n exmple sentence: A smll ct ets the fish English grmmr hs rules for constructing sentences;
More information