Properties of Regular Languages. Reading: Chapter 4
|
|
- Stephany Poole
- 5 years ago
- Views:
Transcription
1 Properties of Regular Laguages Readig: Chapter 4
2 Topics ) How to prove whether a give laguage is regular or ot? 2) Closure properties of regular laguages 3) Miimizatio of DFAs 2
3 Some laguages are ot regular Whe is a laguage is regular? if we are able to costruct oe of the followig: DFA or NFA or ε -NFA or regular expressio Whe is it ot? If we ca show that o FA ca be built for a laguage 3
4 How to prove laguages are ot regular? What if we caot come up with ay FA? A) Ca it be laguage that is ot regular? B) Or is it that we tried wrog approaches? How do we decisively prove that a laguage is ot regular? The hardest thig of all is to fid a black cat i a dark room, especially if there is o cat! -Cofucius 4
5 Example of a o-regular laguage Let L = {w w is of the form, for all } Hypothesis: L is ot regular Ituitive ratioale: How do you keep track of a ruig cout i a FA? A more formal ratioale: By cotraditio, if L is regular the there should exist a DFA for L. Let k = umber of states i that DFA. Cosider the special word w= k k => w L DFA is i some state p i, after cosumig the first i symbols i w 5
6 Uses Pigeo Hole Priciple Ratioale Let {p,p, p k } be the sequece of states that the DFA should have visited after cosumig the first k symbols i w which is k But there are oly k states i the DFA! ==> at least oe state should repeat somewhere alog the path (by ++ Priciple) ==> Let the repeatig state be p i =p J for i < j ==> We ca fool the DFA by iputig (k-(j-i)) k ad still get it to accept (ote: k-(j-i) is at most k-). ==> DFA accepts strigs w/ uequal umber of s ad s, implyig that the DFA is wrog! 6
7 The Pumpig Lemma for Regular Laguages What it is? The Pumpig Lemma is a property of all regular laguages. How is it used? A techique that is used to show that a give laguage is ot regular 7
8 Pumpig Lemma for Regular Laguages Let L be a regular laguage The there exists some costat N such that for every strig w L s.t. w N, there exists a way to break w ito three parts, w=xyz, such that:. y ε 2. xy N 3. For all k, all strigs of the form xy k z L This property should hold for all regular laguages. Defiitio: N is called the Pumpig Lemma Costat 8
9 Pumpig Lemma: Proof L is regular => it should have a DFA. Set N := umber of states i the DFA Ay strig w L, s.t. w N, should have the form: w=a a 2 a m, where m N Let the states traversed after readig the first N symbols be: {p,p, p N } ==> There are N+ p-states, while there are oly N DFA states ==> at least oe state has to repeat i.e, p i = p J where i<j N (by PHP) 9
10 Pumpig Lemma: Proof => We should be able to break w=xyz as follows: x=a a 2..a i ; y=a i+ a i+2..a J ; z=a J+ a J+2..a m x s path will be p..p i y s path will be p i p i+..p J (but p i =p J implyig a loop) z s path will be p J p J+..p m Now cosider aother strig w k =xy k z, where k Case k= y k (for k loops) p x z p i p m =p j DFA will reach the accept state p m Case k> DFA will loop for y k, ad fially reach the accept state p m for z I either case, w k L This proves part (3) of the lemma
11 Pumpig Lemma: Proof For part (): Sice i<j, y ε y k (for k loops) p x z p i p m =p j For part (2): By PHP, the repetitio of states has to occur withi the first N symbols i w ==> xy N
12 The Purpose of the Pumpig Lemma for RL To prove that some laguages caot be regular. 2
13 How to use the pumpig lemma? Thik of playig a 2 perso game Role : We claim that the laguage caot be regular Role 2: A adversary who claims the laguage is regular We show that the adversary s statemet will lead to a cotradictio that implyies pumpig lemma caot hold for the laguage. We wi!! 3
14 How to use the pumpig lemma? (The Steps). (we) L is ot regular. 2. (adv.) Claims that L is regular ad gives you a value for N as its P/L costat 3. (we) Usig N, choose a strig w L s.t.,. w N, 2. Usig w as the template, costruct other words w k of the form xy k z ad show that at least oe such w k L => this implies we have successfully broke the pumpig lemma for the laguage, ad hece that the adversary is wrog. (Note: I this process, we may have to try may values of k, startig with k=, ad the 2, 3,.. so o, util w k L ) 4
15 Note: We do t have ay cotrol over N, except that it is positive. We also do t have ay cotrol over how to split w=xyz, but xyz should respect the P/L coditios () ad (2). Usig the Pumpig Lemma What WE do? 3. Usig N, we costruct our template strig w 4. Demostrate to the adversary, either through pumpig up or dow o w, that some strig w k L (this should happe regardless of w=xyz) What the Adversary does?. Claims L is regular 2. Provides N 5
16 Note: This N ca be aythig (eed ot ecessarily be the #states i the DFA. It s the adversary s choice.) Example of usig the Pumpig Lemma to prove that a laguage is ot regular Let L eq = {w w is a biary strig with equal umber of s ad s} Your Claim: L eq is ot regular Proof: By cotradictio, let L eq be regular P/L costat should exist Let N = that P/L costat Cosider iput w = N N (your choice for the template strig) By pumpig lemma, we should be able to break w=xyz, such that: ) y ε 2) xy N 3) For all k, the strig xy k z is also i L è adv. è adv. è you èyou 6
17 Template strig w = N N =. N N Proof Settig k= is referred to as pumpig dow Because xy N, xy should cotai oly s (This ad because y ε, implies y= + ) Therefore x ca cotai at most N- s Also, all the N s must be iside z By (3), ay strig of the form xy k z L eq for all k Case k=: xz has at most N- s but has N s Therefore, xy z L eq This violates the P/L (a cotradictio) è you Settig k> is referred to as pumpig up Aother way of provig this will be to show that if the #s is arbitrarily pumped up (e.g., k=2), the the #s will become exceed the #s 7
18 Exercise 2 Prove L = { } is ot regular Note: This is ot to be cofused with the pumpig lemma costat N. That ca be differet. I other words, the above questio is same as provig: L = { m m m } is ot regular 8
19 Example 3: Pumpig Lemma Claim: L = { i i is a perfect square} is ot regular Proof: By cotradictio, let L be regular. P/L should apply Let N = P/L costat Choose w= N2 By pumpig lemma, w=xyz satisfyig all three rules By rules () & (2), y has betwee ad N s By rule (3), ay strig of the form xy k z is also i L for all k Case k=: #zeros (xy z) = #zeros (xyz) - #zeros (y) N 2 N #zeros (xy z) N 2 - (N-) 2 < N 2 - N #zeros (xy z) N 2 - < N 2 xy z L But the above will complete the proof ONLY IF N>. (proof cotd.. Next slide) 9
20 Example 3: Pumpig Lemma (proof cotd ) If the adversary pick N=, the (N-) 2 N 2 N, ad therefore the #zeros(xy z) could ed up beig a perfect square! This meas that pumpig dow (i.e., settig k=) is ot givig us the proof! So lets try pumpig up ext Case k=2: #zeros (xy 2 z) = #zeros (xyz) + #zeros (y) N 2 + #zeros (xy 2 z) N 2 + N N 2 < N 2 + #zeros (xy 2 z) N 2 + N < (N+) 2 xy 2 z L (Notice that the above should hold for all possible N values of N>. Therefore, this completes the proof.) 2
21 Closure properties of Regular Laguages 2
22 Closure properties for Regular Laguages (RL) Closure property: If a set of regular laguages are combied usig a operator, the the resultig laguage is also regular Regular laguages are closed uder: This is differet from Kleee closure Uio, itersectio, complemet, differece Reversal Kleee closure Cocateatio Homomorphism Iverse homomorphism Now, lets prove all of this! 22
23 RLs are closed uder uio IF L ad M are two RLs THEN: they both have two correspodig regular expressios, R ad S respectively (L U M) ca be represeted usig the regular expressio R+S Therefore, (L U M) is also regular How ca this be proved usig FAs? 23
24 RLs are closed uder complemetatio DFA for L If L is a RL over, the L= *-L To show L is also regular, make the followig costructio Covert every fial state ito o-fial, ad every o-fial state ito a fial state q F DFA for L q F q q i q F2 q q i q F2 q Fk q Fk Assumes q is a o-fial state. If ot, do the opposite. 24
25 RLs are closed uder itersectio A quick, idirect way to prove: By DeMorga s law: L M = (L U M) Sice we kow RLs are closed uder uio ad complemetatio, they are also closed uder itersectio A more direct way would be costruct a fiite automato for L M 25
26 DFA costructio for L M A L = DFA for L = {Q L,, q L,F L, δ L } A M = DFA for M = {Q M,, q M,F M, δ M } Build A L M = {Q L x Q M,, (q L,q M ), F L x F M,δ} such that: δ((p,q),a) = (δ L (p,a), δ M (q,a)), where p i Q L, ad q i Q M This costructio esures that a strig w will be accepted if ad oly if w reaches a acceptig state i both iput DFAs. 26
27 DFA costructio for L M DFA for L q F DFA for M p F q q i a q j q F2 p p i a p j p F2 DFA for L M (q F,p F ) (q,p ) a (q i,p i ) (q j,p j ) 27
28 RLs are closed uder set differece We observe: L - M = L M Closed uder itersectio Closed uder complemetatio Therefore, L - M is also regular 28
29 RLs are closed uder reversal Reversal of a strig w is deoted by w R E.g., w=, w R = Reversal of a laguage: L R = The laguage geerated by reversig all strigs i L Theorem: If L is regular the L R is also regular 29
30 ε -NFA Costructio for L R New ε-nfa for L R DFA for L q F ε Make the old start state as the oly ew fial state q q i a q j q F2 q Fk ε ε q New start state What to do if q was oe of the fial states i the iput DFA? Reverse all trasitios Covert the old set of fial states ito o-fial states 3
31 If L is regular, L R is regular (proof usig regular expressios) Let E be a regular expressio for L Give E, how to build E R? Basis: If E= ε,, or a, the E R =E Iductio: Every part of E (refer to the part as F ) ca be i oly oe of the three followig forms:. F = F +F 2 F R = F R +F R 2 2. F = F F 2 F R = F 2R F R 3. F = (F )* (F R )* = (F R )* 3
32 Homomorphisms Substitute each symbol i (mai alphabet) by a correspodig strig i T (aother alphabet) h: --->T* Example: Let ={,} ad T={a,b} Let a homomorphic fuctio h o be: h()=ab, h()=ε If w=, the h(w) = εabεεab = abab I geeral, h(w) = h(a ) h(a 2 ) h(a ) 32
33 RLs are closed uder homomorphisms Theorem: If L is regular, the so is h(l) Proof: If E is a RE for L, the show L(h(E)) = h(l(e)) Basis: If E= ε,, or a, the the claim holds. Iductio: There are three forms of E:. E = E +E 2 L(h(E)) = L(h(E ) + h(e 2 )) = L(h(E )) U L(h(E 2 )) () h(l(e)) = h(l(e ) + L(E 2 )) = h(l(e )) U h(l(e 2 )) (2) By iductive hypothesis, L(h(E ))= h(l(e )) ad L(h(E 2 ))= h(l(e 2 )) 2. E = E E 2 3. E = (E )* Therefore, L(h(E)= h(l(e) Similar argumet Thik of a DFA based costructio 33
34 Give a DFA for L, how to covert it ito a FA for h(l)? FA Costructio for h(l) DFA for L q F Replace every edge a by a path labeled h(a) i the ew DFA q q i a q j q F2 h(a) q Fk - Build a ew FA that simulates h(a) for every symbol a trasitio i the above DFA - The resultig FA may or may ot be a DFA, but will be a FA for h(l) 34
35 Give a DFA for M, how to covert it ito a FA for h - (M)? The set of strigs i * whose homomorphic traslatio results i the strigs of M Iverse homomorphism Let h: --->T* Let M be a laguage over alphabet T h - (M) = {w w * s.t., h(w) M } Claim: If M is regular, the so is h - (M) Proof: Let A be a DFA for M Costruct aother DFA A which ecodes h - (M) A is a exact replica of A, except that its trasitio fuctios are s.t. for ay iput symbol a i, A will simulate h(a) i A. δ(p,a) = δ(p,h(a)) 35
36 Decisio properties of regular laguages Ay decisio problem looks like this: Iput (geerally a questio) Decisio problem solver Yes No 36
37 Membership questio Decisio Problem: Give L, is w i L? Possible aswers: Yes or No Approach:. Build a DFA for L 2. Iput w to the DFA 3. If the DFA eds i a acceptig state, the yes; otherwise o. 37
38 Emptiess test Decisio Problem: Is L=? Approach: O a DFA for L:. From the start state, ru a reachability test, which returs:. success: if there is at least oe fial state that is reachable from the start state 2. failure: otherwise 2. L= if ad oly if the reachability test fails How to implemet the reachability test? 38
39 Fiiteess Decisio Problem: Is L fiite or ifiite? Approach: O a DFA for L:. Remove all states ureachable from the start state 2. Remove all states that caot lead to ay acceptig state. 3. After removal, check for cycles i the resultig FA 4. L is fiite if there are o cycles; otherwise it is ifiite Aother approach Build a regular expressio ad look for Kleee closure How to implemet steps 2 ad 3? 39
40 Fiiteess test - examples Ex ) Is the laguage of this DFA fiite or ifiite? X q 6 X Ex 2) Is the laguage of this DFA fiite or ifiite? FINITE X INFINITE due to this 4
41 Equivalece & Miimizatio of DFAs 4
42 Applicatios of iterest Comparig two DFAs: L(DFA ) == L(DFA 2 )? How to miimize a DFA?. Remove ureachable states 2. Idetify & codese equivalet states ito oe 42
43 Whe to call two states i a DFA equivalet? Past does t matter - oly future does! AND Two states p ad q are said to be equivalet iff: i) Ay strig w accepted by startig at p is also accepted by startig at q; ii) p q Ay strig w rejected by startig at p is also rejected by startig at q. è p q p q w w 43
44 Computig equivalet states i a DFA Table Fillig Algorithm A C E G B D F H Pass #. Mark acceptig states o-acceptig states Pass #. Compare every pair of states 2. Distiguish by oe symbol trasitio 3. Mark = or or blak(tbd) Pass #2. Compare every pair of states 2. Distiguish by up to two symbol trasitios (util differet or same or tbd). (keep repeatig util table complete) A = B = = C x x = D x x x = E x x x x = F x x x x x = G x x x = x x = H x x = x x x x = A B C D E F G H 44
45 Table Fillig Algorithm - step by step A C E G B D F H A = B = C = D = E = F = G = H = A B C D E F G H 45
46 Table Fillig Algorithm - step by step A C E G B D F H. Mark X betwee acceptig vs. o-acceptig state A = B = C = D = E X X X X = F X = G X = H X = A B C D E F G H 46
47 Table Fillig Algorithm - step by step A C E G B D F H. Mark X betwee acceptig vs. o-acceptig state 2. Look - hop away for distiguishig states or strigs A = B = C X = D X = E X X X X = F X = G X X = H X X = A B C D E F G H 47
48 Table Fillig Algorithm - step by step A C E G B D F H. Mark X betwee acceptig vs. o-acceptig state 2. Look - hop away for distiguishig states or strigs A = B = C X X = D X X = E X X X X = F X = G X X X = H X X X = A B C D E F G H 48
49 Table Fillig Algorithm - step by step A C E G B D F H. Mark X betwee acceptig vs. o-acceptig state 2. Look - hop away for distiguishig states or strigs A = B = C X X = D X X X = E X X X X = F X X = G X X X X = H X X = X = A B C D E F G H 49
50 Table Fillig Algorithm - step by step A C E G B D F H. Mark X betwee acceptig vs. o-acceptig state 2. Look - hop away for distiguishig states or strigs A = B = C X X = D X X X = E X X X X = F X X X = G X X X = X = H X X = X X = A B C D E F G H 5
51 Table Fillig Algorithm - step by step A C E G B D F H. Mark X betwee acceptig vs. o-acceptig state 2. Look - hop away for distiguishig states or strigs A = B = C X X = D X X X = E X X X X = F X X X = G X X X = X X = H X X = X X X = A B C D E F G H 5
52 Table Fillig Algorithm - step by step A C E G B D F H. Mark X betwee acceptig vs. o-acceptig state 2. Look - hop away for distiguishig states or strigs A = B = C X X = D X X X = E X X X X = F X X X = G X X X = X X = H X X = X X X X = A B C D E F G H 52
53 Table Fillig Algorithm - step by step A C E G B D F H A = B = =. Mark X betwee acceptig vs. o-acceptig state 2. Pass : Look - hop away for distiguishig states or strigs 3. Pass 2: Look -hop away agai for distiguishig states or strigs cotiue. C X X = D X X X = E X X X X = F X X X X X = G X X X = X X = H X X = X X X X = A B C D E F G H 53
54 Table Fillig Algorithm - step by step A C E G B D F H A = B = = C X X = D X X X = E X X X X = F X X X X X = G X X X = X X =. Mark X betwee acceptig vs. o-acceptig state H X X = X X X X = 2. Pass : A B C D E F G H Look - hop away for distiguishig states or strigs 3. Pass 2: Look -hop away agai for distiguishig states or strigs Equivaleces: cotiue. A=B C=H D=G 54
55 Table Fillig Algorithm - step by step A C E G B D F H A C E D F Retrai oly oe copy for each equivalece set of states Equivaleces: A=B C=H D=G 55
56 Table Fillig Algorithm special case A C E G B D F H Q) What happes if the iput DFA has more tha oe fial state? Ca all fial states iitially be treated as equivalet to oe aother? A = B = C = D = E? = F = G = H = A B C D E F G H 56
57 Puttig it all together How to miimize a DFA? Goal: Miimize the umber of states i a DFA Depth-first traversal from the start state Algorithm:. Elimiate states ureachable from the start state Table fillig algorithm 2. Idetify ad remove equivalet states 3. Output the resultat DFA 57
58 Are Two DFAs Equivalet? Uified DFA DFA q DFA 2 Is q q? : if yes, the DFA DFA 2 : else, ot equiv. q. Make a ew dummy DFA by just puttig together both DFAs 2. Ru table-fillig algorithm o the uified DFA 3. IF the start states of both DFAs are foud to be equivalet, THEN: DFA DFA 2 ELSE: differet 58
59 Summary How to prove laguages are ot regular? Pumpig lemma & its applicatios Closure properties of regular laguages Simplificatio of DFAs How to remove ureachable states? How to idetify ad collapse equivalet states? How to miimize a DFA? How to tell whether two DFAs are equivalet? 59
Course 8 Properties of Regular Languages
Course 8 Properties of Regular Laguages The structure ad the cotet of the lecture is based o http://www.eecs.wsu.edu/~aath/cpts37/lectures/idex.htm Topics ) How to prove whether a give laguage is ot regular?
More informationFinite Automata. Reading: Chapter 2
Fiite Automata Readig: Chapter 2 Fiite Automato (FA) Iformally, a state diagram that comprehesively captures all possible states ad trasitios that a machie ca take while respodig to a stream or sequece
More informationInfinite Sequences and Series
Chapter 6 Ifiite Sequeces ad Series 6.1 Ifiite Sequeces 6.1.1 Elemetary Cocepts Simply speakig, a sequece is a ordered list of umbers writte: {a 1, a 2, a 3,...a, a +1,...} where the elemets a i represet
More informationIf a subset E of R contains no open interval, is it of zero measure? For instance, is the set of irrationals in [0, 1] is of measure zero?
2 Lebesgue Measure I Chapter 1 we defied the cocept of a set of measure zero, ad we have observed that every coutable set is of measure zero. Here are some atural questios: If a subset E of R cotais a
More informationLecture 2: April 3, 2013
TTIC/CMSC 350 Mathematical Toolkit Sprig 203 Madhur Tulsiai Lecture 2: April 3, 203 Scribe: Shubhedu Trivedi Coi tosses cotiued We retur to the coi tossig example from the last lecture agai: Example. Give,
More informationWorksheet on Generating Functions
Worksheet o Geeratig Fuctios October 26, 205 This worksheet is adapted from otes/exercises by Nat Thiem. Derivatives of Geeratig Fuctios. If the sequece a 0, a, a 2,... has ordiary geeratig fuctio A(x,
More informationPRACTICE FINAL SOLUTIONS
CSE 303 PRACTICE FINAL SOLUTIONS FOR FINAL stud Practice Fial (mius PUMPING LEMMA ad Turig Machies) ad Problems from Q1 Q4, Practice Q1 Q4, ad Midterm ad Practice midterm. I will choose some of these problems
More informationMathematical Induction
Mathematical Iductio Itroductio Mathematical iductio, or just iductio, is a proof techique. Suppose that for every atural umber, P() is a statemet. We wish to show that all statemets P() are true. I a
More informationMA131 - Analysis 1. Workbook 2 Sequences I
MA3 - Aalysis Workbook 2 Sequeces I Autum 203 Cotets 2 Sequeces I 2. Itroductio.............................. 2.2 Icreasig ad Decreasig Sequeces................ 2 2.3 Bouded Sequeces..........................
More informationIntroduction to Automata Theory. Reading: Chapter 1
Itroductio to Automata Theory Readig: Chapter 1 1 What is Automata Theory? Study of abstract computig devices, or machies Automato = a abstract computig device Note: A device eed ot eve be a physical hardware!
More information1. By using truth tables prove that, for all statements P and Q, the statement
Author: Satiago Salazar Problems I: Mathematical Statemets ad Proofs. By usig truth tables prove that, for all statemets P ad Q, the statemet P Q ad its cotrapositive ot Q (ot P) are equivalet. I example.2.3
More informationSEQUENCES AND SERIES
Sequeces ad 6 Sequeces Ad SEQUENCES AND SERIES Successio of umbers of which oe umber is desigated as the first, other as the secod, aother as the third ad so o gives rise to what is called a sequece. Sequeces
More informationLesson 10: Limits and Continuity
www.scimsacademy.com Lesso 10: Limits ad Cotiuity SCIMS Academy 1 Limit of a fuctio The cocept of limit of a fuctio is cetral to all other cocepts i calculus (like cotiuity, derivative, defiite itegrals
More informationLecture Notes for Analysis Class
Lecture Notes for Aalysis Class Topological Spaces A topology for a set X is a collectio T of subsets of X such that: (a) X ad the empty set are i T (b) Uios of elemets of T are i T (c) Fiite itersectios
More information1 Generating functions for balls in boxes
Math 566 Fall 05 Some otes o geeratig fuctios Give a sequece a 0, a, a,..., a,..., a geeratig fuctio some way of represetig the sequece as a fuctio. There are may ways to do this, with the most commo ways
More informationInduction: Solutions
Writig Proofs Misha Lavrov Iductio: Solutios Wester PA ARML Practice March 6, 206. Prove that a 2 2 chessboard with ay oe square removed ca always be covered by shaped tiles. Solutio : We iduct o. For
More informationSequences I. Chapter Introduction
Chapter 2 Sequeces I 2. Itroductio A sequece is a list of umbers i a defiite order so that we kow which umber is i the first place, which umber is i the secod place ad, for ay atural umber, we kow which
More informationComputability and computational complexity
Computability ad computatioal complexity Lecture 4: Uiversal Turig machies. Udecidability Io Petre Computer Sciece, Åbo Akademi Uiversity Fall 2015 http://users.abo.fi/ipetre/computability/ 21. toukokuu
More information( ) = p and P( i = b) = q.
MATH 540 Radom Walks Part 1 A radom walk X is special stochastic process that measures the height (or value) of a particle that radomly moves upward or dowward certai fixed amouts o each uit icremet of
More informationFrequentist Inference
Frequetist Iferece The topics of the ext three sectios are useful applicatios of the Cetral Limit Theorem. Without kowig aythig about the uderlyig distributio of a sequece of radom variables {X i }, for
More information6.3 Testing Series With Positive Terms
6.3. TESTING SERIES WITH POSITIVE TERMS 307 6.3 Testig Series With Positive Terms 6.3. Review of what is kow up to ow I theory, testig a series a i for covergece amouts to fidig the i= sequece of partial
More informationIt is always the case that unions, intersections, complements, and set differences are preserved by the inverse image of a function.
MATH 532 Measurable Fuctios Dr. Neal, WKU Throughout, let ( X, F, µ) be a measure space ad let (!, F, P ) deote the special case of a probability space. We shall ow begi to study real-valued fuctios defied
More informationAxioms of Measure Theory
MATH 532 Axioms of Measure Theory Dr. Neal, WKU I. The Space Throughout the course, we shall let X deote a geeric o-empty set. I geeral, we shall ot assume that ay algebraic structure exists o X so that
More informationw (1) ˆx w (1) x (1) /ρ and w (2) ˆx w (2) x (2) /ρ.
2 5. Weighted umber of late jobs 5.1. Release dates ad due dates: maximimizig the weight of o-time jobs Oce we add release dates, miimizig the umber of late jobs becomes a sigificatly harder problem. For
More informationRecurrence Relations
Recurrece Relatios Aalysis of recursive algorithms, such as: it factorial (it ) { if (==0) retur ; else retur ( * factorial(-)); } Let t be the umber of multiplicatios eeded to calculate factorial(). The
More informationDiscrete Mathematics for CS Spring 2007 Luca Trevisan Lecture 22
CS 70 Discrete Mathematics for CS Sprig 2007 Luca Trevisa Lecture 22 Aother Importat Distributio The Geometric Distributio Questio: A biased coi with Heads probability p is tossed repeatedly util the first
More informationMath 220A Fall 2007 Homework #2. Will Garner A
Math 0A Fall 007 Homewor # Will Garer Pg 3 #: Show that {cis : a o-egative iteger} is dese i T = {z œ : z = }. For which values of q is {cis(q): a o-egative iteger} dese i T? To show that {cis : a o-egative
More informationContext-free grammars and. Basics of string generation methods
Cotext-free grammars ad laguages Basics of strig geeratio methods What s so great about regular expressios? A regular expressio is a strig represetatio of a regular laguage This allows the storig a whole
More informationREAL ANALYSIS II: PROBLEM SET 1 - SOLUTIONS
REAL ANALYSIS II: PROBLEM SET 1 - SOLUTIONS 18th Feb, 016 Defiitio (Lipschitz fuctio). A fuctio f : R R is said to be Lipschitz if there exists a positive real umber c such that for ay x, y i the domai
More informationSeunghee Ye Ma 8: Week 5 Oct 28
Week 5 Summary I Sectio, we go over the Mea Value Theorem ad its applicatios. I Sectio 2, we will recap what we have covered so far this term. Topics Page Mea Value Theorem. Applicatios of the Mea Value
More information4.3 Growth Rates of Solutions to Recurrences
4.3. GROWTH RATES OF SOLUTIONS TO RECURRENCES 81 4.3 Growth Rates of Solutios to Recurreces 4.3.1 Divide ad Coquer Algorithms Oe of the most basic ad powerful algorithmic techiques is divide ad coquer.
More informationChapter 10: Power Series
Chapter : Power Series 57 Chapter Overview: Power Series The reaso series are part of a Calculus course is that there are fuctios which caot be itegrated. All power series, though, ca be itegrated because
More information6 Integers Modulo n. integer k can be written as k = qn + r, with q,r, 0 r b. So any integer.
6 Itegers Modulo I Example 2.3(e), we have defied the cogruece of two itegers a,b with respect to a modulus. Let us recall that a b (mod ) meas a b. We have proved that cogruece is a equivalece relatio
More informationDefinition 4.2. (a) A sequence {x n } in a Banach space X is a basis for X if. unique scalars a n (x) such that x = n. a n (x) x n. (4.
4. BASES I BAACH SPACES 39 4. BASES I BAACH SPACES Sice a Baach space X is a vector space, it must possess a Hamel, or vector space, basis, i.e., a subset {x γ } γ Γ whose fiite liear spa is all of X ad
More informationLecture 9: Hierarchy Theorems
IAS/PCMI Summer Sessio 2000 Clay Mathematics Udergraduate Program Basic Course o Computatioal Complexity Lecture 9: Hierarchy Theorems David Mix Barrigto ad Alexis Maciel July 27, 2000 Most of this lecture
More informationLecture Notes for CS 313H, Fall 2011
Lecture Notes for CS 313H, Fall 011 August 5. We start by examiig triagular umbers: T () = 1 + + + ( = 0, 1,,...). Triagular umbers ca be also defied recursively: T (0) = 0, T ( + 1) = T () + + 1, or usig
More informationMath 61CM - Solutions to homework 3
Math 6CM - Solutios to homework 3 Cédric De Groote October 2 th, 208 Problem : Let F be a field, m 0 a fixed oegative iteger ad let V = {a 0 + a x + + a m x m a 0,, a m F} be the vector space cosistig
More informationProduct measures, Tonelli s and Fubini s theorems For use in MAT3400/4400, autumn 2014 Nadia S. Larsen. Version of 13 October 2014.
Product measures, Toelli s ad Fubii s theorems For use i MAT3400/4400, autum 2014 Nadia S. Larse Versio of 13 October 2014. 1. Costructio of the product measure The purpose of these otes is to preset the
More information2.4 Sequences, Sequences of Sets
72 CHAPTER 2. IMPORTANT PROPERTIES OF R 2.4 Sequeces, Sequeces of Sets 2.4.1 Sequeces Defiitio 2.4.1 (sequece Let S R. 1. A sequece i S is a fuctio f : K S where K = { N : 0 for some 0 N}. 2. For each
More information2017 PRACTICE MIDTERM SOLUTIONS
CSE303 2017 PRACTICE MIDTERM SOLUTIONS 1 YES/NO questios 1. For a biar relatio R A A, R exists. Justif: defiitio 2. For a biar relatio R A A, R 1 exists. Justif: The set R 1 = {(b, a) : (a, b) R} alwas
More informationSECTION 1.5 : SUMMATION NOTATION + WORK WITH SEQUENCES
SECTION 1.5 : SUMMATION NOTATION + WORK WITH SEQUENCES Read Sectio 1.5 (pages 5 9) Overview I Sectio 1.5 we lear to work with summatio otatio ad formulas. We will also itroduce a brief overview of sequeces,
More informationMA131 - Analysis 1. Workbook 3 Sequences II
MA3 - Aalysis Workbook 3 Sequeces II Autum 2004 Cotets 2.8 Coverget Sequeces........................ 2.9 Algebra of Limits......................... 2 2.0 Further Useful Results........................
More informationSquare-Congruence Modulo n
Square-Cogruece Modulo Abstract This paper is a ivestigatio of a equivalece relatio o the itegers that was itroduced as a exercise i our Discrete Math class. Part I - Itro Defiitio Two itegers are Square-Cogruet
More informationMATH 304: MIDTERM EXAM SOLUTIONS
MATH 304: MIDTERM EXAM SOLUTIONS [The problems are each worth five poits, except for problem 8, which is worth 8 poits. Thus there are 43 possible poits.] 1. Use the Euclidea algorithm to fid the greatest
More informationBertrand s Postulate
Bertrad s Postulate Lola Thompso Ross Program July 3, 2009 Lola Thompso (Ross Program Bertrad s Postulate July 3, 2009 1 / 33 Bertrad s Postulate I ve said it oce ad I ll say it agai: There s always a
More informationA Proof of Birkhoff s Ergodic Theorem
A Proof of Birkhoff s Ergodic Theorem Joseph Hora September 2, 205 Itroductio I Fall 203, I was learig the basics of ergodic theory, ad I came across this theorem. Oe of my supervisors, Athoy Quas, showed
More informationChapter 4. Fourier Series
Chapter 4. Fourier Series At this poit we are ready to ow cosider the caoical equatios. Cosider, for eample the heat equatio u t = u, < (4.) subject to u(, ) = si, u(, t) = u(, t) =. (4.) Here,
More informationMetric Space Properties
Metric Space Properties Math 40 Fial Project Preseted by: Michael Brow, Alex Cordova, ad Alyssa Sachez We have already poited out ad will recogize throughout this book the importace of compact sets. All
More informationSequences, Mathematical Induction, and Recursion. CSE 2353 Discrete Computational Structures Spring 2018
CSE 353 Discrete Computatioal Structures Sprig 08 Sequeces, Mathematical Iductio, ad Recursio (Chapter 5, Epp) Note: some course slides adopted from publisher-provided material Overview May mathematical
More informationThe Borel hierarchy classifies subsets of the reals by their topological complexity. Another approach is to classify them by size.
Lecture 7: Measure ad Category The Borel hierarchy classifies subsets of the reals by their topological complexity. Aother approach is to classify them by size. Filters ad Ideals The most commo measure
More informationMarkov Decision Processes
Markov Decisio Processes Defiitios; Statioary policies; Value improvemet algorithm, Policy improvemet algorithm, ad liear programmig for discouted cost ad average cost criteria. Markov Decisio Processes
More informationMath F215: Induction April 7, 2013
Math F25: Iductio April 7, 203 Iductio is used to prove that a collectio of statemets P(k) depedig o k N are all true. A statemet is simply a mathematical phrase that must be either true or false. Here
More information(A sequence also can be thought of as the list of function values attained for a function f :ℵ X, where f (n) = x n for n 1.) x 1 x N +k x N +4 x 3
MATH 337 Sequeces Dr. Neal, WKU Let X be a metric space with distace fuctio d. We shall defie the geeral cocept of sequece ad limit i a metric space, the apply the results i particular to some special
More informationInfinite Series. Definition. An infinite series is an expression of the form. Where the numbers u k are called the terms of the series.
Ifiite Series Defiitio. A ifiite series is a expressio of the form uk = u + u + u + + u + () 2 3 k Where the umbers u k are called the terms of the series. Such a expressio is meat to be the result of
More informationAn Introduction to Randomized Algorithms
A Itroductio to Radomized Algorithms The focus of this lecture is to study a radomized algorithm for quick sort, aalyze it usig probabilistic recurrece relatios, ad also provide more geeral tools for aalysis
More informationSolutions to Math 347 Practice Problems for the final
Solutios to Math 347 Practice Problems for the fial 1) True or False: a) There exist itegers x,y such that 50x + 76y = 6. True: the gcd of 50 ad 76 is, ad 6 is a multiple of. b) The ifiimum of a set is
More informationCSE 191, Class Note 05: Counting Methods Computer Sci & Eng Dept SUNY Buffalo
Coutig Methods CSE 191, Class Note 05: Coutig Methods Computer Sci & Eg Dept SUNY Buffalo c Xi He (Uiversity at Buffalo CSE 191 Discrete Structures 1 / 48 Need for Coutig The problem of coutig the umber
More informationPolynomials with Rational Roots that Differ by a Non-zero Constant. Generalities
Polyomials with Ratioal Roots that Differ by a No-zero Costat Philip Gibbs The problem of fidig two polyomials P(x) ad Q(x) of a give degree i a sigle variable x that have all ratioal roots ad differ by
More informationDiscrete-Time Systems, LTI Systems, and Discrete-Time Convolution
EEL5: Discrete-Time Sigals ad Systems. Itroductio I this set of otes, we begi our mathematical treatmet of discrete-time s. As show i Figure, a discrete-time operates or trasforms some iput sequece x [
More informationMath 475, Problem Set #12: Answers
Math 475, Problem Set #12: Aswers A. Chapter 8, problem 12, parts (b) ad (d). (b) S # (, 2) = 2 2, sice, from amog the 2 ways of puttig elemets ito 2 distiguishable boxes, exactly 2 of them result i oe
More information7 Sequences of real numbers
40 7 Sequeces of real umbers 7. Defiitios ad examples Defiitio 7... A sequece of real umbers is a real fuctio whose domai is the set N of atural umbers. Let s : N R be a sequece. The the values of s are
More information[ 11 ] z of degree 2 as both degree 2 each. The degree of a polynomial in n variables is the maximum of the degrees of its terms.
[ 11 ] 1 1.1 Polyomial Fuctios 1 Algebra Ay fuctio f ( x) ax a1x... a1x a0 is a polyomial fuctio if ai ( i 0,1,,,..., ) is a costat which belogs to the set of real umbers ad the idices,, 1,...,1 are atural
More informationEnd-of-Year Contest. ERHS Math Club. May 5, 2009
Ed-of-Year Cotest ERHS Math Club May 5, 009 Problem 1: There are 9 cois. Oe is fake ad weighs a little less tha the others. Fid the fake coi by weighigs. Solutio: Separate the 9 cois ito 3 groups (A, B,
More informationMath 299 Supplement: Real Analysis Nov 2013
Math 299 Supplemet: Real Aalysis Nov 203 Algebra Axioms. I Real Aalysis, we work withi the axiomatic system of real umbers: the set R alog with the additio ad multiplicatio operatios +,, ad the iequality
More informationSets. Sets. Operations on Sets Laws of Algebra of Sets Cardinal Number of a Finite and Infinite Set. Representation of Sets Power Set Venn Diagram
Sets MILESTONE Sets Represetatio of Sets Power Set Ve Diagram Operatios o Sets Laws of lgebra of Sets ardial Number of a Fiite ad Ifiite Set I Mathematical laguage all livig ad o-livig thigs i uiverse
More information6.003 Homework #3 Solutions
6.00 Homework # Solutios Problems. Complex umbers a. Evaluate the real ad imagiary parts of j j. π/ Real part = Imagiary part = 0 e Euler s formula says that j = e jπ/, so jπ/ j π/ j j = e = e. Thus the
More informationChapter 6 Infinite Series
Chapter 6 Ifiite Series I the previous chapter we cosidered itegrals which were improper i the sese that the iterval of itegratio was ubouded. I this chapter we are goig to discuss a topic which is somewhat
More informationRandom Models. Tusheng Zhang. February 14, 2013
Radom Models Tusheg Zhag February 14, 013 1 Radom Walks Let me describe the model. Radom walks are used to describe the motio of a movig particle (object). Suppose that a particle (object) moves alog the
More informationAssignment 5: Solutions
McGill Uiversity Departmet of Mathematics ad Statistics MATH 54 Aalysis, Fall 05 Assigmet 5: Solutios. Let y be a ubouded sequece of positive umbers satisfyig y + > y for all N. Let x be aother sequece
More informationResolution Proofs of Generalized Pigeonhole Principles
Resolutio Proofs of Geeralized Pigeohole Priciples Samuel R. Buss Departmet of Mathematics Uiversity of Califoria, Berkeley Győrgy Turá Departmet of Mathematics, Statistics, ad Computer Sciece Uiversity
More informationOptimally Sparse SVMs
A. Proof of Lemma 3. We here prove a lower boud o the umber of support vectors to achieve geeralizatio bouds of the form which we cosider. Importatly, this result holds ot oly for liear classifiers, but
More informationCSE 1400 Applied Discrete Mathematics Number Theory and Proofs
CSE 1400 Applied Discrete Mathematics Number Theory ad Proofs Departmet of Computer Scieces College of Egieerig Florida Tech Sprig 01 Problems for Number Theory Backgroud Number theory is the brach of
More information10-701/ Machine Learning Mid-term Exam Solution
0-70/5-78 Machie Learig Mid-term Exam Solutio Your Name: Your Adrew ID: True or False (Give oe setece explaatio) (20%). (F) For a cotiuous radom variable x ad its probability distributio fuctio p(x), it
More information7.1 Convergence of sequences of random variables
Chapter 7 Limit theorems Throughout this sectio we will assume a probability space (Ω, F, P), i which is defied a ifiite sequece of radom variables (X ) ad a radom variable X. The fact that for every ifiite
More informationMassachusetts Institute of Technology
6.0/6.3: Probabilistic Systems Aalysis (Fall 00) Problem Set 8: Solutios. (a) We cosider a Markov chai with states 0,,, 3,, 5, where state i idicates that there are i shoes available at the frot door i
More informationPRELIM PROBLEM SOLUTIONS
PRELIM PROBLEM SOLUTIONS THE GRAD STUDENTS + KEN Cotets. Complex Aalysis Practice Problems 2. 2. Real Aalysis Practice Problems 2. 4 3. Algebra Practice Problems 2. 8. Complex Aalysis Practice Problems
More information11. FINITE FIELDS. Example 1: The following tables define addition and multiplication for a field of order 4.
11. FINITE FIELDS 11.1. A Field With 4 Elemets Probably the oly fiite fields which you ll kow about at this stage are the fields of itegers modulo a prime p, deoted by Z p. But there are others. Now although
More information(ii) Two-permutations of {a, b, c}. Answer. (B) P (3, 3) = 3! (C) 3! = 6, and there are 6 items in (A). ... Answer.
SOLUTIONS Homewor 5 Due /6/19 Exercise. (a Cosider the set {a, b, c}. For each of the followig, (A list the objects described, (B give a formula that tells you how may you should have listed, ad (C verify
More informationAnalytic Continuation
Aalytic Cotiuatio The stadard example of this is give by Example Let h (z) = 1 + z + z 2 + z 3 +... kow to coverge oly for z < 1. I fact h (z) = 1/ (1 z) for such z. Yet H (z) = 1/ (1 z) is defied for
More informationCS161: Algorithm Design and Analysis Handout #10 Stanford University Wednesday, 10 February 2016
CS161: Algorithm Desig ad Aalysis Hadout #10 Staford Uiversity Wedesday, 10 February 2016 Lecture #11: Wedesday, 10 February 2016 Topics: Example midterm problems ad solutios from a log time ago Sprig
More informationLecture 11: Hash Functions and Random Oracle Model
CS 7810 Foudatios of Cryptography October 16, 017 Lecture 11: Hash Fuctios ad Radom Oracle Model Lecturer: Daiel Wichs Scribe: Akshar Varma 1 Topic Covered Defiitio of Hash Fuctios Merkle-Damgaård Theorem
More informationChapter 0. Review of set theory. 0.1 Sets
Chapter 0 Review of set theory Set theory plays a cetral role i the theory of probability. Thus, we will ope this course with a quick review of those otios of set theory which will be used repeatedly.
More informationDesign and Analysis of Algorithms
Desig ad Aalysis of Algorithms Probabilistic aalysis ad Radomized algorithms Referece: CLRS Chapter 5 Topics: Hirig problem Idicatio radom variables Radomized algorithms Huo Hogwei 1 The hirig problem
More informationLecture 11: Pseudorandom functions
COM S 6830 Cryptography Oct 1, 2009 Istructor: Rafael Pass 1 Recap Lecture 11: Pseudoradom fuctios Scribe: Stefao Ermo Defiitio 1 (Ge, Ec, Dec) is a sigle message secure ecryptio scheme if for all uppt
More informationDiscrete Mathematics for CS Spring 2005 Clancy/Wagner Notes 21. Some Important Distributions
CS 70 Discrete Mathematics for CS Sprig 2005 Clacy/Wager Notes 21 Some Importat Distributios Questio: A biased coi with Heads probability p is tossed repeatedly util the first Head appears. What is the
More informationMATH 324 Summer 2006 Elementary Number Theory Solutions to Assignment 2 Due: Thursday July 27, 2006
MATH 34 Summer 006 Elemetary Number Theory Solutios to Assigmet Due: Thursday July 7, 006 Departmet of Mathematical ad Statistical Scieces Uiversity of Alberta Questio [p 74 #6] Show that o iteger of the
More informationMA131 - Analysis 1. Workbook 10 Series IV
MA131 - Aalysis 1 Workbook 10 Series IV Autum 2004 Cotets 4.19 Rearragemets of Series...................... 1 4.19 Rearragemets of Series If you take ay fiite set of umbers ad rearrage their order, their
More informationMath 25 Solutions to practice problems
Math 5: Advaced Calculus UC Davis, Sprig 0 Math 5 Solutios to practice problems Questio For = 0,,, 3,... ad 0 k defie umbers C k C k =! k!( k)! (for k = 0 ad k = we defie C 0 = C = ). by = ( )... ( k +
More informationDefinitions and Theorems. where x are the decision variables. c, b, and a are constant coefficients.
Defiitios ad Theorems Remember the scalar form of the liear programmig problem, Miimize, Subject to, f(x) = c i x i a 1i x i = b 1 a mi x i = b m x i 0 i = 1,2,, where x are the decisio variables. c, b,
More informationInformation Theory and Statistics Lecture 4: Lempel-Ziv code
Iformatio Theory ad Statistics Lecture 4: Lempel-Ziv code Łukasz Dębowski ldebowsk@ipipa.waw.pl Ph. D. Programme 203/204 Etropy rate is the limitig compressio rate Theorem For a statioary process (X i)
More informationRandomized Algorithms I, Spring 2018, Department of Computer Science, University of Helsinki Homework 1: Solutions (Discussed January 25, 2018)
Radomized Algorithms I, Sprig 08, Departmet of Computer Sciece, Uiversity of Helsiki Homework : Solutios Discussed Jauary 5, 08). Exercise.: Cosider the followig balls-ad-bi game. We start with oe black
More informationMathematical Foundations -1- Sets and Sequences. Sets and Sequences
Mathematical Foudatios -1- Sets ad Sequeces Sets ad Sequeces Methods of proof 2 Sets ad vectors 13 Plaes ad hyperplaes 18 Liearly idepedet vectors, vector spaces 2 Covex combiatios of vectors 21 eighborhoods,
More informationRoberto s Notes on Infinite Series Chapter 1: Sequences and series Section 3. Geometric series
Roberto s Notes o Ifiite Series Chapter 1: Sequeces ad series Sectio Geometric series What you eed to kow already: What a ifiite series is. The divergece test. What you ca le here: Everythig there is to
More informationACCESS TO SCIENCE, ENGINEERING AND AGRICULTURE: MATHEMATICS 1 MATH00030 SEMESTER / Statistics
ACCESS TO SCIENCE, ENGINEERING AND AGRICULTURE: MATHEMATICS 1 MATH00030 SEMESTER 1 018/019 DR. ANTHONY BROWN 8. Statistics 8.1. Measures of Cetre: Mea, Media ad Mode. If we have a series of umbers the
More informationClassification of problem & problem solving strategies. classification of time complexities (linear, logarithmic etc)
Classificatio of problem & problem solvig strategies classificatio of time complexities (liear, arithmic etc) Problem subdivisio Divide ad Coquer strategy. Asymptotic otatios, lower boud ad upper boud:
More informationLecture 10: Mathematical Preliminaries
Lecture : Mathematical Prelimiaries Obective: Reviewig mathematical cocepts ad tools that are frequetly used i the aalysis of algorithms. Lecture # Slide # I this
More informationConvergence of random variables. (telegram style notes) P.J.C. Spreij
Covergece of radom variables (telegram style otes).j.c. Spreij this versio: September 6, 2005 Itroductio As we kow, radom variables are by defiitio measurable fuctios o some uderlyig measurable space
More informationVector Quantization: a Limiting Case of EM
. Itroductio & defiitios Assume that you are give a data set X = { x j }, j { 2,,, }, of d -dimesioal vectors. The vector quatizatio (VQ) problem requires that we fid a set of prototype vectors Z = { z
More informationCS284A: Representations and Algorithms in Molecular Biology
CS284A: Represetatios ad Algorithms i Molecular Biology Scribe Notes o Lectures 3 & 4: Motif Discovery via Eumeratio & Motif Represetatio Usig Positio Weight Matrix Joshua Gervi Based o presetatios by
More informationEE260: Digital Design, Spring n Binary Addition. n Complement forms. n Subtraction. n Multiplication. n Inputs: A 0, B 0. n Boolean equations:
EE260: Digital Desig, Sprig 2018 EE 260: Itroductio to Digital Desig Arithmetic Biary Additio Complemet forms Subtractio Multiplicatio Overview Yao Zheg Departmet of Electrical Egieerig Uiversity of Hawaiʻi
More information