Logic, Set Theory and Computability [M. Coppenbarger]

Size: px
Start display at page:

Download "Logic, Set Theory and Computability [M. Coppenbarger]"

Transcription

1 14 Orer (Hnout) Definition 7-11: A reltion is qusi-orering (or preorer) if it is reflexive n trnsitive. A quisi-orering tht is symmetri is n equivlene reltion. A qusi-orering tht is nti-symmetri is n orer (or prtil orer). Definition 14-1: A strit orer on X is n irreflexive, ntisymmetri, trnsitive reltion on X. Definition 14-2: Let (X, ) e n orer n let x,y X. The open intervl from x to y, enote x,y, is efine s x,y = { z X : x z y }. The lose intervl from x to y, enote [x,y], is efine s [x,y] = { z X : x z y }. Definition 14-3: Let (X, ) e n orer. For x,y X, x is overe y y (or y overs x) if x y n x,y =. The overing reltion of X, entoe R (X, ), is the reltion efine y (x,y) R (X, ) if x is overe y y. Definition 14-4: Let (X, ) e n orer. The Hsse igrm of poset (A, ) is the unirete grph representtion r (X, ) so tht if the rrows in the irete eges re inlue, then they woul ll e irete upwr. Definition 14-5: An orer (X, ) is totl if x y or y x for ll x,y X. A strit orer (X, ) is totl if x y or y x for ll x,y X with x y. Definition 14-6: For set X, if there exists n orering suh tht (X, ) is totl, then X is lle totlly orere set. Definition 14-7: Let (X, ) e n orer n X. is miniml element of X if there oes not exist y X suh tht y. is mximl element of X if there oes not exist x X suh tht x, Definition 14-8: Let (X, ) e n orer n X. is minimum element of X, enote min(x), if x for ll x X is mximum element of X, enote mx(x), if x for ll x X. Definition 14-9: Let (X, ) e n orer. We sy tht (X, ) is well-orere if every nonempty suset of X hs minimum element. Definition 14-10: Let (X, ) e n orer. For X, the priniple iel generte y, enote, is efine y = { x X : x }. For X, the wek priniple iel generte y, enote, is efine y = { x X : x }. For S X, the iel generte y S, enote S, is efine y S = { x X : x for ll S }. Definition 14-11: Let (X, ) e n orer. Let X. The priniple filter generte y, enote, is efine y = { x X : x }. Let S X. The filter generte y S, enote S, is efine y S = { x X : x for ll S }. Definition 14-12: Let (X, ) e n orer with S X. If there exists z S suh tht z for ll S, then z is the infimum of S n enote inf S. If there exists z S suh tht z for ll S, then z is the supremum of S n enote sup S. Definition 14-13: An orer (X, ) is lttie if inf{x,y} n sup{x,y} oth exist for every x,y X. Definition 14-14: Let (X, ) e lttie. For x,y X, the meet of x n y, enote x y, is efine s x y = inf{x,y} n the join of x n y, enote x y, is efine s x y = sup{x,y}.

2 Beginning Exerises 14-A-1. Let s e reltion on 4 = { 0, 1, 2, 3 } efine y s = { (0,1), (0,3), (3,1), (3,2) }. Let t e the smllest orer suh tht s t. () Wht re the orere pirs in t? () For (4, t), etermine [0,3], [2,1], n 3,1. () List the orere pirs in R (4, t). () Drw the Hsse igrm of t. (e) Determine ll mximl n miniml elements of (4, t). (f) Evlute for eh 4. (g) Evlute for eh 4. (h) Let S = { 1, 2 }. Evlute inf S n sup S, if they exist. 14-A-2. Let (X, ) e n orer given y the Hsse igrm to the right. () Determine [,]. () Show tht (X, ) is lttie. () Is it possile to n extr orere pir to (X, ) n still hve lttie? f e 14-A-3. The Hsse igrm for the orere set (X, s) where X = {,,, } n the orer s = i X { (,), (,), (,), (,) } is given s the grph in (). Wht is the set n orer for () n ()? () () () e f g f e 14-A-4. Drw Hsse igrms for the following orere sets (X, s). () X = {,,,, e }, s = { (,), (,), (,), (,e), (,e), (,e), (,e) } i X () X = {,,,, e, f, g }, s = { (,g), (,g), (,g), (g,e), (g,f ), (,e), (,f ), (,e), (,f ), (,e), (,f ) } i X () X = {,,, }, s = { (,) } i X () X = 3, s = ( ) For eh exmple isuss whih elements re mximl, miniml, mximum, minimum. 14-A-5. Let X = {,,,, e } n let s = { (,), (,), (,e) }. Prove tht s is strit orer on X, is not totl, n hs three miniml n two mximl elements. 14-A-6. Prove tht if n orere set X hs two istint miniml elements, then it hs no minimum element. 14-A-7. Construt ll orers on the set 3. Whih re totl? 14-A-8. Cn e n orer? A strit orer? 14-A-9. Prove tht s 1 is n orer on X iff s is n orer on X. 14-A-10. Let X e set. Prove tht the reltion s = { (A, B) : A,B X n A B } is n orer on X.

3 14-A-11. Let s e n orer on set X n A X. Prove eh of the following. () Prove tht s (A A) is n orer on A. () Prove tht if s is totl on X, then s (A A) is totl on A. 14-A-12. () If s is n orer on X, prove tht s i X is strit orer. () If s is strit orer on X, prove tht s i X is n orer. 14-A-13. Prove tht n orer n hve t most one miniml element. 14-A-14. Prove tht minimum element is miniml element. 14-A-15. Prove tht if x n y re istint miniml elements, then they re inomprle. 14-A-16. Prove tht [x,y] = x y. 14-A-17. Determine ll ltties with 5 or fewer elements. Construt the Hsse igrms of eh. 14-A-18. Show tht there re 15 istint ltties with 6 elements. Intermeite Exerises 14-B-1. Let X e set n let C X e olletion of susets of X. Prove tht (C, ) is n orer on X. 14-B-2. Let X e n orere set. Let S e finite nonempty totlly orere suset of X n let = sup S. Prove tht = gl S. Give n exmple where S is not totlly orere n the onlusion is flse. 14-B-2. Let S e the set of ll orers on given set X. (S, ) is itself n orere set. () Drw the Hsse igrm of (S, ) in the se where X = 3. () Prove tht t is totl iff t is mximl element of (S, ). 14-B-3. Let s e n ntisymmetri reltion on X. By exmple, prove it my e the se tht there exists no orer t suh tht s t. In other wors, not every ntisymmetri reltion my e extene to n orer. 14-B-4. Let X e n orere set suh tht every nonempty suset A of X with n upper oun in X hs lest upper oun in X. Prove tht every nonempty suset B of X with lower oun in X hs gretest lower oun in X. 14-B-5. Let X n Y e orere sets n let f : X 9 Y e surjetion. Let x < y iff f (x) < f (y) for ll x,y in X. Prove tht f is n injetion. 14-B-6. Let (s i ) i I e nonempty fmily of equivlene reltions on X totlly orere y inlusion. Prove tht «i I s i is n equivlene reltion on X. 14-B-7. Let (s i ) i I e nonempty fmily of orers on X totlly orere y inlusion. Prove tht «i I s i is n orer on X. 14-B-9. Let (X, ) e n orer n let C = { : X } e the olletion of priniple iels of (X, ). Prove eh of the following. () «C X () If X, then»c =.

4 14-B-10. Let (X, ) e n orer n let C = { * : X } = s*(x) e the olletion of wek priniple iels of (X, ). Prove eh of the following. () «C = X () If X, then min( X), if min( X) exists;»c =, otherwise. 14-B-11. Let (X, ) e n orer. Prove if, X n * = *, then =. 14-B-12. Let (X, ) e n orer n let C = { : X } e the olletion of priniple iels of (X, ). On C efine reltion r s r = { (, ) : }. () Prove tht r is n orer on C. () Assign the symol to this orer so tht if (, ) r. Prove tht (C, ) is totlly orere iff (X, ) is totlly orere. 14-B-13. Let R e the set of ll orers on X n S the set of ll strit orers on X. Show tht S ~ R. 14-B-14. Let (X, ) e well-orering. Prove tht (X, ) is totl. Hrer Exerises 14-C-1. Let r e qusi-orer on X. Prove tht there exists n equivlene reltion s on X suh tht the reltion t = { (x / s, y / s) : (x,y) r } is n orer on X / s. 14-C-2. Let s e n orer on X n t n orer on Y. Define reltion r on X Y s r = { ( (x 1,y 1 ), (x 2,y 2 ) ) : (x 1,x 2 ) s n (y 1,y 2 ) t }. Prove tht r is n orer on X Y. [This is known s the prout orer.] 14-C-3. Let s e strit orer on X n t e strit orer on Y. Define reltion r on X Y s r = { ( (x 1,y 1 ), (x 2,y 2 ) ) r : (y 1,y 2 ) t or [(x 1,x 2 ) s n y 1 = y 2 ] }. Prove r is strit orer on X Y. [This is known s the orering y lst ifferenes.] 14-C-4. Let X e set. Given the prtitions S n T of X, S is si to e finer thn T iff A S implies A B for some B T. Define reltion r on the set of prtitions of X s r = { (S,T) : S n T re prtitions of X n S is finer thn T }. Prove tht r is n orer. [Instrutor s Note: Herefter, we will enote S T to men (S,T) r.] 14-C-5. Let R e olletion of orers on set X. () Prove tht if R is nonempty, then»r is n orer. () Provie ounterexmple to show tht «R is not lwys n orer. () Provie neessry n suffiient onition for «R to e n orer. 14-C-6. Assume knowlege of the rel numers R. Define reltion s on X = R [0,1] s s = { (f, g) : f, g R [0,1] n f (x) g(x) 0 for ll x [0,1] }. Prove tht s is n orer. Prove or isprove tht s is totl.

5 14-C-7. Let f, g : X Y. () Prove tht there exists n equivlene reltion r on Y suh tht if f r : Y Y / r is the ssoite quotient mp, then f r g = f r f. () Prove if s is ny equivlene reltion on Y suh tht f s f = f s g, then r s n Y / r Y / s. () Conlue tht there exists h : Y / r Y / s suh tht h f r = f s. 14-C-8. Let S n T e prtitions of X. Define the ross prtition of S n T to e S Ö T = { A B : A S n B T } 1. () Prove tht S Ö T S, S Ö T T, n tht S Ö T is the lest fine prtition finer thn oth S n T. Thus we n efine the supremum of S n T s sup{ S, T } = S Ö T. () Let r n s e the equivlene reltion nturlly orresponing respetively to S n T. Prove tht r s orrespons to S Ö T. () Prove there exists prtition R whih stisfies the following three properties: (i) S R, (ii) T R, (iii) if R is ny other prtition stisfying (i) n (ii), then R R. Thus we n efine R s the infimum of S n T n enote it s R = inf{ S, T }.

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

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

More information

Discrete Structures, Test 2 Monday, March 28, 2016 SOLUTIONS, VERSION α

Discrete 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 information

Mid-Term Examination - Spring 2014 Mathematical Programming with Applications to Economics Total Score: 45; Time: 3 hours

Mid-Term Examination - Spring 2014 Mathematical Programming with Applications to Economics Total Score: 45; Time: 3 hours Mi-Term Exmintion - Spring 0 Mthemtil Progrmming with Applitions to Eonomis Totl Sore: 5; Time: hours. Let G = (N, E) e irete grph. Define the inegree of vertex i N s the numer of eges tht re oming into

More information

POSITIVE IMPLICATIVE AND ASSOCIATIVE FILTERS OF LATTICE IMPLICATION ALGEBRAS

POSITIVE IMPLICATIVE AND ASSOCIATIVE FILTERS OF LATTICE IMPLICATION ALGEBRAS Bull. Koren Mth. So. 35 (998), No., pp. 53 6 POSITIVE IMPLICATIVE AND ASSOCIATIVE FILTERS OF LATTICE IMPLICATION ALGEBRAS YOUNG BAE JUN*, YANG XU AND KEYUN QIN ABSTRACT. We introue the onepts of positive

More information

CIT 596 Theory of Computation 1. Graphs and Digraphs

CIT 596 Theory of Computation 1. Graphs and Digraphs CIT 596 Theory of Computtion 1 A grph G = (V (G), E(G)) onsists of two finite sets: V (G), the vertex set of the grph, often enote y just V, whih is nonempty set of elements lle verties, n E(G), the ege

More information

CS 491G Combinatorial Optimization Lecture Notes

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

More information

If the numbering is a,b,c,d 1,2,3,4, then the matrix representation is as follows:

If the numbering is a,b,c,d 1,2,3,4, then the matrix representation is as follows: Reltions. Solutions 1. ) true; ) true; ) flse; ) true; e) flse; f) true; g) flse; h) true; 2. 2 A B 3. Consier ll reltions tht o not inlue the given pir s n element. Oviously, the rest of the reltions

More information

CS311 Computational Structures Regular Languages and Regular Grammars. Lecture 6

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

More information

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

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

More information

CM10196 Topic 4: Functions and Relations

CM10196 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 information

Minimal DFA. minimal DFA for L starting from any other

Minimal 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 information

Graph Theory. Simple Graph G = (V, E). V={a,b,c,d,e,f,g,h,k} E={(a,b),(a,g),( a,h),(a,k),(b,c),(b,k),...,(h,k)}

Graph Theory. Simple Graph G = (V, E). V={a,b,c,d,e,f,g,h,k} E={(a,b),(a,g),( a,h),(a,k),(b,c),(b,k),...,(h,k)} Grph Theory Simple Grph G = (V, E). V ={verties}, E={eges}. h k g f e V={,,,,e,f,g,h,k} E={(,),(,g),(,h),(,k),(,),(,k),...,(h,k)} E =16. 1 Grph or Multi-Grph We llow loops n multiple eges. G = (V, E.ψ)

More information

KENDRIYA VIDYALAYA IIT KANPUR HOME ASSIGNMENTS FOR SUMMER VACATIONS CLASS - XII MATHEMATICS (Relations and Functions & Binary Operations)

KENDRIYA VIDYALAYA IIT KANPUR HOME ASSIGNMENTS FOR SUMMER VACATIONS CLASS - XII MATHEMATICS (Relations and Functions & Binary Operations) KENDRIYA VIDYALAYA IIT KANPUR HOME ASSIGNMENTS FOR SUMMER VACATIONS 6-7 CLASS - XII MATHEMATICS (Reltions nd Funtions & Binry Opertions) For Slow Lerners: - A Reltion is sid to e Reflexive if.. every A

More information

378 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 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 information

QUADRATIC EQUATION. Contents

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

More information

Surds and Indices. Surds and Indices. Curriculum Ready ACMNA: 233,

Surds and Indices. Surds and Indices. Curriculum Ready ACMNA: 233, Surs n Inies Surs n Inies Curriulum Rey ACMNA:, 6 www.mthletis.om Surs SURDS & & Inies INDICES Inies n surs re very losely relte. A numer uner (squre root sign) is lle sur if the squre root n t e simplifie.

More information

On Implicative and Strong Implicative Filters of Lattice Wajsberg Algebras

On Implicative and Strong Implicative Filters of Lattice Wajsberg Algebras Glol Journl of Mthemtil Sienes: Theory nd Prtil. ISSN 974-32 Volume 9, Numer 3 (27), pp. 387-397 Interntionl Reserh Pulition House http://www.irphouse.om On Implitive nd Strong Implitive Filters of Lttie

More information

Review: set theoretic definition of the numbers. Natural numbers:

Review: set theoretic definition of the numbers. Natural numbers: Review: reltions A inry reltion on set A is suset R Ñ A ˆ A, where elements p, q re written s. Exmple: A Z nd R t pmod nqu. A inry reltion on set A is... (R) reflexive if for ll P A; (S) symmetric if implies

More information

Compression of Palindromes and Regularity.

Compression of Palindromes and Regularity. Compression of Plinromes n Regulrity. Kyoko Shikishim-Tsuji Center for Lierl Arts Eution n Reserh Tenri University 1 Introution In [1], property of likstrem t t view of tse is isusse n it is shown tht

More information

2. Properties of Functions

2. Properties of Functions 2. PROPERTIES OF FUNCTIONS 111 2. Properties of Funtions 2.1. Injetions, Surjetions, an Bijetions. Definition 2.1.1. Given f : A B 1. f is one-to-one (short han is 1 1) or injetive if preimages are unique.

More information

Total score: /100 points

Total score: /100 points Points misse: Stuent's Nme: Totl sore: /100 points Est Tennessee Stte University Deprtment of Computer n Informtion Sienes CSCI 2710 (Trnoff) Disrete Strutures TEST 2 for Fll Semester, 2004 Re this efore

More information

Factorising FACTORISING.

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

More information

Lecture 6: Coding theory

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

More information

Vidyalankar S.E. Sem. III [CMPN] Discrete Structures Prelim Question Paper Solution

Vidyalankar S.E. Sem. III [CMPN] Discrete Structures Prelim Question Paper Solution S.E. Sem. III [CMPN] Discrete Structures Prelim Question Pper Solution 1. () (i) Disjoint set wo sets re si to be isjoint if they hve no elements in common. Exmple : A = {0, 4, 7, 9} n B = {3, 17, 15}

More information

arxiv: v1 [cs.cg] 28 Apr 2009

arxiv: v1 [cs.cg] 28 Apr 2009 Orienttion-Constrine Retngulr Lyouts Dvi Eppstein 1 n Elen Mumfor 2 1 Deprtment of Computer Siene, University of Cliforni, Irvine, USA 2 Deprtment of Mthemtis n Computer Siene, TU Einhoven, The Netherlns

More information

Lecture 3 ( ) (translated and slightly adapted from lecture notes by Martin Klazar)

Lecture 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 information

Discrete Structures Lecture 11

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

More information

arxiv: v2 [math.co] 31 Oct 2016

arxiv: v2 [math.co] 31 Oct 2016 On exlue minors of onnetivity 2 for the lss of frme mtrois rxiv:1502.06896v2 [mth.co] 31 Ot 2016 Mtt DeVos Dryl Funk Irene Pivotto Astrt We investigte the set of exlue minors of onnetivity 2 for the lss

More information

GNFA GNFA GNFA GNFA GNFA

GNFA GNFA GNFA GNFA GNFA DFA RE NFA DFA -NFA REX GNFA Definition GNFA A generlize noneterministic finite utomton (GNFA) is grph whose eges re lele y regulr expressions, with unique strt stte with in-egree, n unique finl stte with

More information

Lesson 55 - Inverse of Matrices & Determinants

Lesson 55 - Inverse of Matrices & Determinants // () Review Lesson - nverse of Mtries & Determinnts Mth Honors - Sntowski - t this stge of stuying mtries, we know how to, subtrt n multiply mtries i.e. if Then evlute: () + B (b) - () B () B (e) B n

More information

Part 4. Integration (with Proofs)

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

More information

Random subgroups of a free group

Random subgroups of a free group Rndom sugroups of free group Frédérique Bssino LIPN - Lortoire d Informtique de Pris Nord, Université Pris 13 - CNRS Joint work with Armndo Mrtino, Cyril Nicud, Enric Ventur et Pscl Weil LIX My, 2015 Introduction

More information

Finite Automata Theory and Formal Languages TMV027/DIT321 LP4 2018

Finite 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 information

MATH 101A: ALGEBRA I PART B: RINGS AND MODULES 35

MATH 101A: ALGEBRA I PART B: RINGS AND MODULES 35 MATH 101A: ALGEBRA I PART B: RINGS AND MODULES 35 9. Modules over PID This week we re proving the fundmentl theorem for finitely generted modules over PID, nmely tht they re ll direct sums of cyclic modules.

More information

Properties of the Riemann Integral

Properties of the Riemann Integral Properties of the Riemnn Integrl Jmes K. Peterson Deprtment of Biologicl Sciences nd Deprtment of Mthemticl Sciences Clemson University Februry 15, 2018 Outline 1 Some Infimum nd Supremum Properties 2

More information

Bisimulation, Games & Hennessy Milner logic

Bisimulation, 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 information

The final exam will take place on Friday May 11th from 8am 11am in Evans room 60.

The final exam will take place on Friday May 11th from 8am 11am in Evans room 60. Mth 104: finl informtion The finl exm will tke plce on Fridy My 11th from 8m 11m in Evns room 60. The exm will cover ll prts of the course with equl weighting. It will cover Chpters 1 5, 7 15, 17 21, 23

More information

Regular Language. Nonregular Languages The Pumping Lemma. The pumping lemma. Regular Language. The pumping lemma. Infinitely long words 3/17/15

Regular Language. Nonregular Languages The Pumping Lemma. The pumping lemma. Regular Language. The pumping lemma. Infinitely long words 3/17/15 Regulr Lnguge Nonregulr Lnguges The Pumping Lemm Models of Comput=on Chpter 10 Recll, tht ny lnguge tht cn e descried y regulr expression is clled regulr lnguge In this lecture we will prove tht not ll

More information

a,b a 1 a 2 a 3 a,b 1 a,b a,b 2 3 a,b a,b a 2 a,b CS Determinisitic Finite Automata 1

a,b a 1 a 2 a 3 a,b 1 a,b a,b 2 3 a,b a,b a 2 a,b CS Determinisitic Finite Automata 1 CS4 45- Determinisitic Finite Automt -: Genertors vs. Checkers Regulr expressions re one wy to specify forml lnguge String Genertor Genertes strings in the lnguge Deterministic Finite Automt (DFA) re nother

More information

Lecture 11 Binary Decision Diagrams (BDDs)

Lecture 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 information

Lecture 2: Cayley Graphs

Lecture 2: Cayley Graphs Mth 137B Professor: Pri Brtlett Leture 2: Cyley Grphs Week 3 UCSB 2014 (Relevnt soure mteril: Setion VIII.1 of Bollos s Moern Grph Theory; 3.7 of Gosil n Royle s Algeri Grph Theory; vrious ppers I ve re

More information

Harvard University Computer Science 121 Midterm October 23, 2012

Harvard University Computer Science 121 Midterm October 23, 2012 Hrvrd University Computer Science 121 Midterm Octoer 23, 2012 This is closed-ook exmintion. You my use ny result from lecture, Sipser, prolem sets, or section, s long s you quote it clerly. The lphet is

More information

Algebra 2 Semester 1 Practice Final

Algebra 2 Semester 1 Practice Final Alger 2 Semester Prtie Finl Multiple Choie Ientify the hoie tht est ompletes the sttement or nswers the question. To whih set of numers oes the numer elong?. 2 5 integers rtionl numers irrtionl numers

More information

Graph Algorithms. Vertex set = { a,b,c,d } Edge set = { {a,c}, {b,c}, {c,d}, {b,d}} Figure 1: An example for a simple graph

Graph Algorithms. Vertex set = { a,b,c,d } Edge set = { {a,c}, {b,c}, {c,d}, {b,d}} Figure 1: An example for a simple graph Inin Institute of Informtion Tehnology Design n Mnufturing, Knheepurm, Chenni 00, Ini An Autonomous Institute uner MHRD, Govt of Ini http://www.iiitm..in COM 0T Design n Anlysis of Algorithms -Leture Notes

More information

Special Numbers, Factors and Multiples

Special Numbers, Factors and Multiples Specil s, nd Student Book - Series H- + 3 + 5 = 9 = 3 Mthletics Instnt Workooks Copyright Student Book - Series H Contents Topics Topic - Odd, even, prime nd composite numers Topic - Divisiility tests

More information

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

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

More information

Chapter Five: Nondeterministic Finite Automata. Formal Language, chapter 5, slide 1

Chapter 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 information

University of Sioux Falls. MAT204/205 Calculus I/II

University 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

Slope Lengths for 2-Bridge Parent Manifolds. Martin D. Bobb

Slope Lengths for 2-Bridge Parent Manifolds. Martin D. Bobb Cliorni Stte University, Sn Bernrino Reserh Experiene or Unergrutes Knot Theory Otoer 28, 2013 Hyperoli Knot Complements Hyperoli Knots Deinition A knot or link K is hyperoli i hyperoli metri n e ple on

More information

Algorithm Design and Analysis

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

More information

Graph width-parameters and algorithms

Graph width-parameters and algorithms Grph width-prmeters nd lgorithms Jisu Jeong (KAIST) joint work with Sigve Hortemo Sæther nd Jn Arne Telle (University of Bergen) 2015 KMS Annul Meeting 2015.10.24. YONSEI UNIVERSITY Grph width-prmeters

More information

Exercises with (Some) Solutions

Exercises with (Some) Solutions Exercises with (Some) Solutions Techer: Luc Tesei Mster of Science in Computer Science - University of Cmerino Contents 1 Strong Bisimultion nd HML 2 2 Wek Bisimultion 31 3 Complete Lttices nd Fix Points

More information

Lecture 1. Functional series. Pointwise and uniform convergence.

Lecture 1. Functional series. Pointwise and uniform convergence. 1 Introduction. Lecture 1. Functionl series. Pointwise nd uniform convergence. In this course we study mongst other things Fourier series. The Fourier series for periodic function f(x) with period 2π is

More information

Proportions: A ratio is the quotient of two numbers. For example, 2 3

Proportions: A ratio is the quotient of two numbers. For example, 2 3 Proportions: rtio is the quotient of two numers. For exmple, 2 3 is rtio of 2 n 3. n equlity of two rtios is proportion. For exmple, 3 7 = 15 is proportion. 45 If two sets of numers (none of whih is 0)

More information

for all x in [a,b], then the area of the region bounded by the graphs of f and g and the vertical lines x = a and x = b is b [ ( ) ( )] A= f x g x dx

for all x in [a,b], then the area of the region bounded by the graphs of f and g and the vertical lines x = a and x = b is b [ ( ) ( )] A= f x g x dx Applitions of Integrtion Are of Region Between Two Curves Ojetive: Fin the re of region etween two urves using integrtion. Fin the re of region etween interseting urves using integrtion. Desrie integrtion

More information

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

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

More information

Abstraction of Nondeterministic Automata Rong Su

Abstraction of Nondeterministic Automata Rong Su Astrtion of Nondeterministi Automt Rong Su My 6, 2010 TU/e Mehnil Engineering, Systems Engineering Group 1 Outline Motivtion Automton Astrtion Relevnt Properties Conlusions My 6, 2010 TU/e Mehnil Engineering,

More information

4.1. Probability Density Functions

4.1. Probability Density Functions STT 1 4.1-4. 4.1. Proility Density Functions Ojectives. Continuous rndom vrile - vers - discrete rndom vrile. Proility density function. Uniform distriution nd its properties. Expected vlue nd vrince of

More information

Probability. b a b. a b 32.

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

More information

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

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

More information

Theory of the Integral

Theory of the Integral Spring 2012 Theory of the Integrl Author: Todd Gugler Professor: Dr. Drgomir Sric My 10, 2012 2 Contents 1 Introduction 5 1.0.1 Office Hours nd Contct Informtion..................... 5 1.1 Set Theory:

More information

Lecture 3: Equivalence Relations

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

More information

Lecture 8: Abstract Algebra

Lecture 8: Abstract Algebra Mth 94 Professor: Pri Brtlett Leture 8: Astrt Alger Week 8 UCSB 2015 This is the eighth week of the Mthemtis Sujet Test GRE prep ourse; here, we run very rough-n-tumle review of strt lger! As lwys, this

More information

Surface maps into free groups

Surface maps into free groups Surfce mps into free groups lden Wlker Novemer 10, 2014 Free groups wedge X of two circles: Set F = π 1 (X ) =,. We write cpitl letters for inverse, so = 1. e.g. () 1 = Commuttors Let x nd y e loops. The

More information

Section 1.3 Triangles

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

More information

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

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

More information

April 8, 2017 Math 9. Geometry. Solving vector problems. Problem. Prove that if vectors and satisfy, then.

April 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 information

A Graphical Characterization of Lattice Conditional Independence Models

A Graphical Characterization of Lattice Conditional Independence Models A Grphil Chrteriztion of Lttie Conitionl Inepenene Moels Steen A. Anersson, Dvi Mign, Mihel D. Perlmn *, n Christopher M. Triggs Inin University, University of Wshington, n University of Aukln Astrt Lttie

More information

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

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

More information

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

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

More information

APPENDIX. Precalculus Review D.1. Real Numbers and the Real Number Line

APPENDIX. 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 information

Arrow s Impossibility Theorem

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

More information

Necessary and sucient conditions for some two. Abstract. Further we show that the necessary conditions for the existence of an OD(44 s 1 s 2 )

Necessary and sucient conditions for some two. Abstract. Further we show that the necessary conditions for the existence of an OD(44 s 1 s 2 ) Neessry n suient onitions for some two vrile orthogonl esigns in orer 44 C. Koukouvinos, M. Mitrouli y, n Jennifer Seerry z Deite to Professor Anne Penfol Street Astrt We give new lgorithm whih llows us

More information

(e) if x = y + z and a divides any two of the integers x, y, or z, then a divides the remaining integer

(e) if x = y + z and a divides any two of the integers x, y, or z, then a divides the remaining integer Divisibility In this note we introduce the notion of divisibility for two integers nd b then we discuss the division lgorithm. First we give forml definition nd note some properties of the division opertion.

More information

Algorithm Design and Analysis

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

More information

Eigenvectors and Eigenvalues

Eigenvectors and Eigenvalues MTB 050 1 ORIGIN 1 Eigenvets n Eigenvlues This wksheet esries the lger use to lulte "prinipl" "hrteristi" iretions lle Eigenvets n the "prinipl" "hrteristi" vlues lle Eigenvlues ssoite with these iretions.

More information

Free groups, Lecture 2, part 1

Free groups, Lecture 2, part 1 Free groups, Lecture 2, prt 1 Olg Khrlmpovich NYC, Sep. 2 1 / 22 Theorem Every sugroup H F of free group F is free. Given finite numer of genertors of H we cn compute its sis. 2 / 22 Schreir s grph The

More information

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

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

More information

Math 554 Integration

Math 554 Integration Mth 554 Integrtion Hndout #9 4/12/96 Defn. A collection of n + 1 distinct points of the intervl [, b] P := {x 0 = < x 1 < < x i 1 < x i < < b =: x n } is clled prtition of the intervl. In this cse, we

More information

Unique Solutions R. 4. Probability. C h a p t e r. G l a n c e

Unique Solutions R. 4. Probability. C h a p t e r. G l a n c e . Proility C h p t e r t G l n e Rnom Experiment : An t in whih ll possile (outomes) results re known in vne ut none of them n e preite with ertinty is lle rnom experiment. For e.g. When we toss oin, we

More information

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

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

More information

Coalgebra, Lecture 15: Equations for Deterministic Automata

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

More information

Area and Perimeter. Area and Perimeter. Solutions. Curriculum Ready.

Area and Perimeter. Area and Perimeter. Solutions. Curriculum Ready. Are n Perimeter Are n Perimeter Solutions Curriulum Rey www.mthletis.om How oes it work? Solutions Are n Perimeter Pge questions Are using unit squres Are = whole squres Are = 6 whole squres = units =

More information

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

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

More information

7.2 Riemann Integrable Functions

7.2 Riemann Integrable Functions 7.2 Riemnn Integrble Functions Theorem 1. If f : [, b] R is step function, then f R[, b]. Theorem 2. If f : [, b] R is continuous on [, b], then f R[, b]. Theorem 3. If f : [, b] R is bounded nd continuous

More information

Advanced Calculus: MATH 410 Notes on Integrals and Integrability Professor David Levermore 17 October 2004

Advanced 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 information

Nondeterminism and Nodeterministic Automata

Nondeterminism 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 information

Now we must transform the original model so we can use the new parameters. = S max. Recruits

Now we must transform the original model so we can use the new parameters. = S max. Recruits MODEL FOR VARIABLE RECRUITMENT (ontinue) Alterntive Prmeteriztions of the pwner-reruit Moels We n write ny moel in numerous ifferent ut equivlent forms. Uner ertin irumstnes it is onvenient to work with

More information

Graph States EPIT Mehdi Mhalla (Calgary, Canada) Simon Perdrix (Grenoble, France)

Graph States EPIT Mehdi Mhalla (Calgary, Canada) Simon Perdrix (Grenoble, France) Grph Sttes EPIT 2005 Mehdi Mhll (Clgry, Cnd) Simon Perdrix (Grenole, Frne) simon.perdrix@img.fr Grph Stte: Introdution A grph-sed representtion of the entnglement of some (lrge) quntum stte. Verties: quits

More information

Exam 1 Study Guide. Differentiation and Anti-differentiation Rules from Calculus I

Exam 1 Study Guide. Differentiation and Anti-differentiation Rules from Calculus I Exm Stuy Guie Mth 26 - Clulus II, Fll 205 The following is list of importnt onepts from eh setion tht will be teste on exm. This is not omplete list of the mteril tht you shoul know for the ourse, but

More information

For a continuous function f : [a; b]! R we wish to define the Riemann integral

For a continuous function f : [a; b]! R we wish to define the Riemann integral Supplementry Notes for MM509 Topology II 2. The Riemnn Integrl Andrew Swnn For continuous function f : [; b]! R we wish to define the Riemnn integrl R b f (x) dx nd estblish some of its properties. This

More information

5.4, 6.1, 6.2 Handout. As we ve discussed, the integral is in some way the opposite of taking a derivative. The exact relationship

5.4, 6.1, 6.2 Handout. As we ve discussed, the integral is in some way the opposite of taking a derivative. The exact relationship 5.4, 6.1, 6.2 Hnout As we ve iscusse, the integrl is in some wy the opposite of tking erivtive. The exct reltionship is given by the Funmentl Theorem of Clculus: The Funmentl Theorem of Clculus: If f is

More information

CS 301. Lecture 04 Regular Expressions. Stephen Checkoway. January 29, 2018

CS 301. Lecture 04 Regular Expressions. Stephen Checkoway. January 29, 2018 CS 301 Lecture 04 Regulr Expressions Stephen Checkowy Jnury 29, 2018 1 / 35 Review from lst time NFA N = (Q, Σ, δ, q 0, F ) where δ Q Σ P (Q) mps stte nd n lphet symol (or ) to set of sttes We run n NFA

More information

Particle Physics. Michaelmas Term 2011 Prof Mark Thomson. Handout 3 : Interaction by Particle Exchange and QED. Recap

Particle Physics. Michaelmas Term 2011 Prof Mark Thomson. Handout 3 : Interaction by Particle Exchange and QED. Recap Prtile Physis Mihelms Term 2011 Prof Mrk Thomson g X g X g g Hnout 3 : Intertion y Prtile Exhnge n QED Prof. M.A. Thomson Mihelms 2011 101 Rep Working towrs proper lultion of ey n sttering proesses lnitilly

More information

Convert the NFA into DFA

Convert 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 information

Unit #9 : Definite Integral Properties; Fundamental Theorem of Calculus

Unit #9 : Definite Integral Properties; Fundamental Theorem of Calculus Unit #9 : Definite Integrl Properties; Fundmentl Theorem of Clculus Gols: Identify properties of definite integrls Define odd nd even functions, nd reltionship to integrl vlues Introduce the Fundmentl

More information

Implication Graphs and Logic Testing

Implication Graphs and Logic Testing Implition Grphs n Logi Testing Vishwni D. Agrwl Jmes J. Dnher Professor Dept. of ECE, Auurn University Auurn, AL 36849 vgrwl@eng.uurn.eu www.eng.uurn.eu/~vgrwl Joint reserh with: K. K. Dve, ATI Reserh,

More information

The vertex leafage of chordal graphs

The vertex leafage of chordal graphs The vertex lefge of horl grphs Steven Chplik, Jurj Stho b Deprtment of Physis n Computer Siene, Wilfri Lurier University, 75 University Ave. West, Wterloo, Ontrio N2L 3C5, Cn b DIMAP n Mthemtis Institute,

More information

Beginning Darboux Integration, Math 317, Intro to Analysis II

Beginning Darboux Integration, Math 317, Intro to Analysis II Beginning Droux Integrtion, Mth 317, Intro to Anlysis II Lets strt y rememering how to integrte function over n intervl. (you lerned this in Clculus I, ut mye it didn t stick.) This set of lecture notes

More information

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

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

More information