Relations (3A) Young Won Lim 3/15/18

Size: px
Start display at page:

Download "Relations (3A) Young Won Lim 3/15/18"

Transcription

1 Reltions (A)

2 Copyright (c) Young W. Lim. Permission is grnted to copy, distribute nd/or modify this document under the terms of the GNU Free Documenttion License, Version. or ny lter version published by the Free Softwre Foundtion; with no Invrint Sections, no Front-Cover Texts, nd no Bck-Cover Texts. A copy of the license is included in the section entitled "GNU Free Documenttion License". Plese send corrections (or suggestions) to youngwlim@hotmil.com. This document ws produced by using LibreOffice nd Octve.

3 Crtesin Product Crtesin product A B of the sets A = { x, y, z } nd B = {,, } Reltions (4B)

4 Crtesin Coordintes Crtesin coordintes of exmple points Reltions (4B) 4

5 Crtesin Product 4 5 (,) (,) (,) (,4) (,5) (,) (,) (,) (,4) (,5) (,) (,) (,) (,4) (,5) 4 (4,) (4,) (4,) (4,4) (4,5) 5 (5,) (5,) (5,) (5,4) (5,5) Reltions (4B) 5

6 Crtesin Product (,) (,) (,) (,4) (,5) R R R R4 R5 (,) (,) (,) (,4) (,5) R R R R4 R5 (,) (,) (,) (,4) (,5) R R R R4 R5 4 (4,) (4,) (4,) (4,4) (4,5) 4 R 4R 4R 4R4 4R5 5 (5,) (5,) (5,) (5,4) (5,5) 5 5R 5R 5R 5R4 5R5 Reltions (4B) 6

7 Types of Reltions () x R x Reflexive Reltion Symmetric Reltion Trnsitive Reltion x R y y R x x R y y R z x R z Reltions (4B) 7

8 Types of Reltions () Reflexive: for ll x in X it holds tht xrx. Symmetric: for ll x nd y in X it holds tht if xry then yrx. Antisymmetric: for ll x nd y in X, if xry nd yrx then x = y. Trnsitive: for ll x, y nd z in X it holds tht if xry nd yrz then xrz. Reltions (4B) 8

9 Reltion Exmples () x y 4 5 x > y 4 5 (,) (,) (,) (,) (,) (,) (,) (,) (,) 4 (4,) (4,) (4,) (4,4) 4 (4,) (4,) (4,) 5 (5,) (5,) (5,) (5,4) (5,5) 5 (5,) (5,) (5,) (5,4) Reltions (4B) 9

10 Reltion Exmples () x = y x = y (,) (,) (,) (,) (,) 4 (4,4) 4 (4,) 5 (5,5) 5 (5,4) Reltions (4B) 0

11 Reltion Exmples () x+ y = 4 x+ y (,) (,) (,) (,) (,) (,) (,) (,) (,) Reltions (4B)

12 Reflexive Reltion Exmples Reflexive Reltion Irreflexive Reltion Reltions (4B)

13 Symmetric Reltion Exmples Symmetric Reltion Reltions (4B)

14 Anti-Symmetric Reltion Exmples Reltions (4B) 4

15 Trnsitive Reltion Exmples Reltions (4B) 5

16 Reflexive Reltion x (x, x) R Reltions (4B) 6

17 Symmetric Reltion x, y [ (x, y) R ( y, x) R ] symmetric symmetric symmetric symmetric symmetric symmetric Reltions (4B) 7

18 Not Symmetric Reltion { x, y [ (x, y) R ] [ ( y, x) R ] } x, y { [ (x, y) R ] [ ( y, x) R ] } x, y { [ (x, y) R ] [ ( y, x) R ] } x, y [ (x, y) R ] [ ( y, x) R ] x, y [ (x, y) R ] [ ( y, x) R ] counter exmple not symmetric not symmetric not symmetric Reltions (4B) 8

19 Anti-symmetric Reltion x, y [( (x, y) R ( y, x) R ) x = y ] nti-symmetric nti-symmetric nti-symmetric not nti-symmetric nti-symmetric nti-symmetric Reltions (4B) 9

20 Not Anti-symmetric Reltion x, y [ (x, y) R ( y, x) R ] [ x = y ] x, y { [ (x, y) R ( y, x) R ] [ x = y ]} x, y { [ (x, y) R ( y, x) R ] [ x = y ]} x, y { [ (x, y) R ( y, x) R ] [ x = y ]} x, y { [ (x, y) R ( y, x) R ] [ x y ]} counter exmple not nti-symmetric not nti-symmetric not nti-symmetric Reltions (4B) 0

21 Equivlent Anti-symmetric Reltion x, y [ (x, y) R ( y, x) R ] [ x = y ] x, y [ x y ] [ (x, y) R ( y, x) R ] No symmetric reltion is llowed neither symmetric nor nti-symmetric Reltions (4B)

22 Reflexive, Symmetric, Anti-symmetric x (x, x) R x, y [ (x, y) R ] [ ( y, x) R ] x, y [ (x, y) R ( y, x) R ] [ x = y ] Reflexive Also, symmetric (no reltion for (x, y) where x y) Also, nti-symmetric (no reltion for (x, y) where x y) not symmetric not nti-symmetric nti-symmetric symmetric Reltions (4B)

23 Reltion Exmples R {(,), (, b), (,), (, b)} R {(, x), (, y), (b, y), (b, z)} b x y z Reltions (4B)

24 Composite Reltion Exmples R {(, ), (, b), (, ), (,b)} R {(, x), (, y), (b, y), (b, z)} b x y z x y z R R {(, x), (, y), (, y), (, z), (, x), (, y), (, z)} Reltions (4B) 4

25 Composite Reltion Exmples R {(, ), (, b), (, ), (,b)} R {(, x), (, y), (b, y), (b, z)} R R {(, x), (, y), (, y), (, z), (, x), (, y), (, z)} b x y z x y z b [ 0 A = 0 ] x y z [ A = 0 ] b 0 x y z ] [ 0 ][ A A = 0 0 ] [ 0 0 = 0 Reltions (4B) 5

26 Mtrix of Reltion R {(, ), (, b), (, ), (,b)} R {(, x), (, y), (b, y), (b, z)} b [ 0 A = 0 ] x y z [ A = 0 ] b 0 R R {(, x), (, y), (, y), (, z), (, x), (, y), (, z)} x y z ] [ 0 ][ A A = 0 0 ] [ 0 0 = 0 Reltions (4B) 6

27 Composite Reltion Properties R {(, ), (, b), (, ), (,b)} R {(, x), (, y), (b, y), (b, z)} R R {(, x), (, y), (, y), (, z), (, x), (, y), (, z)} b [ 0 A = 0 ] x y z [ A = 0 ] b 0 x y z ] [ 0 ][ A A = 0 0 ] [ 0 0 = 0 (i, k) R R ik of A A 0 x y z Reltions (4B) 7

28 Sufficient Prt [ 0 ][ A A = 0 0 ] [ 0 = 0 0 j ] j b [ 0 A = 0 ] x y z [ A = 0 ] b 0 i s b t b u v i su+tv su = tv = i {,, } j {x, y, z} s {0, } t {0, } su+tv 0 (s = ) (u = ) (t = ) (v = ) u {0, } v {0, } (i,) R (, j) R (i, b) R (b, j) R (i, j) R R (i, j) R R Reltions (4B) 8

29 Necessry Prt [ 0 ][ A A = 0 0 ] [ 0 = 0 0 j ] j b [ 0 A = 0 ] x y z [ A = 0 ] b 0 i s b t b u v i su+tv i {,, } j {x, y, z} s {0, } t {0, } u {0, } v {0, } (i, j) R R (i,) R (, j) R (i, b) R (b, j) R (s = ) (u = ) su = (t = ) (v = ) tv = su+tv 0 Reltions (4B) 9

30 Necessry Prt [ 0 ][ A A = 0 0 ] [ 0 = 0 0 j ] j b [ 0 A = 0 ] x y z [ A = 0 ] b 0 i s b t b u v i su+tv i {,, } j {x, y, z} s {0, } t {0, } u {0, } v {0, } su+tv 0 nonzero(i, j) th element of A A (i, j) R R Reltions (4B) 0

31 Trnsitivity Test Exmples R {(,), (b,b), (c,c), (d,d), (b, c), (c, b)} R R {(,), (b,b), (c,c), (d,d), (b,c), (c, b)} A = b c d b c d [ ] A A = [ ][ ] 0 0 = b c d b c d [ ] Reltions (4B)

32 Trnsitivity Test A = 4 [ 4 ] A = 4 [ 4 4 ] [ e ] b c d f g 4 h = 4 [ 4 ] nonzero (i, j) th element of A nonzero (i, j) th element of A e = (,) R (,) R b f = c g = d h = (,) R (,) R (,) R (,) R (, 4) R (4,) R (,) R Reltions (4B)

33 Binry Reltions nd Digrphs A = {0,,,,4, 5,6} R A A R = {(,b) b (mod )} R = [ ] Reltions (4B)

34 Reflexive Reltion A = {0,,,,4, 5,6} R A A R = {(,b) b (mod )} R = [ ] Reltions (4B) 4

35 Symmetric Reltion A = {0,,,,4, 5,6} R A A R = {(,b) b (mod )} R = [ ] Reltions (4B) 5

36 Trnsitive Reltion A = {0,,,,4, 5,6} 0 R A A R = {(,b) b (mod )} RR = [ ] Reltions (4B) 6

37 Equivlence Reltion A = {0,,,,4, 5,6} R A A R = {(,b) b (mod )} Equivlence Reltion Reflexive Reltion & Symmetric Reltion & Trnsitive Reltion Reltions (4B) 7

38 Equivlence Clss A = Z + = {0,,,, 4,5, 6, } R A A R = {(,b) b (mod )} {0,, 6, 9, } [0] [] {, 4, 7, 0, } [] [] {, 5, 8,, } [] [] Reltions (4B) 8

39 References [] []

Binary Relations (4B) Young Won Lim 5/15/17

Binary Relations (4B) Young Won Lim 5/15/17 Binry Reltions (4B) Copyright (c) 205 207 Young W. Lim. Permission is grnted to copy, distribute nd/or modify this document under the terms of the GNU Free Documenttion License, Version.2 or ny lter version

More information

Functor (1A) Young Won Lim 8/2/17

Functor (1A) Young Won Lim 8/2/17 Copyright (c) 2016-2017 Young W. Lim. Permission is grnted to copy, distribute nd/or modify this document under the terms of the GNU Free Documenttion License, Version 1.2 or ny lter version published

More information

Functor (1A) Young Won Lim 10/5/17

Functor (1A) Young Won Lim 10/5/17 Copyright (c) 2016-2017 Young W. Lim. Permission is grnted to copy, distribute nd/or modify this document under the terms of the GNU Free Documenttion License, Version 1.2 or ny lter version published

More information

1. Represent each of these relations on {1, 2, 3} with a matrix (with the elements of this set listed in increasing order).

1. Represent each of these relations on {1, 2, 3} with a matrix (with the elements of this set listed in increasing order). Exercises Exercises 1. Represent each of these relations on {1, 2, 3} with a matrix (with the elements of this set listed in increasing order). a) {(1, 1), (1, 2), (1, 3)} b) {(1, 2), (2, 1), (2, 2), (3,

More information

1. Relations 2. Equivalence relations 3. Modular arithmetics. ! Think of relations as directed graphs! xry means there in an edge x!

1. Relations 2. Equivalence relations 3. Modular arithmetics. ! Think of relations as directed graphs! xry means there in an edge x! 2 Today s Topics: CSE 20: Discrete Mathematics for Computer Science Prof. Miles Jones 1. Relations 2. 3. Modular arithmetics 3 4 Relations are graphs! Think of relations as directed graphs! xry means there

More information

Logic and Discrete Mathematics. Section 2.5 Equivalence relations and partitions

Logic and Discrete Mathematics. Section 2.5 Equivalence relations and partitions Logic and Discrete Mathematics Section 2.5 Equivalence relations and partitions Slides version: January 2015 Equivalence relations Let X be a set and R X X a binary relation on X. We call R an equivalence

More information

Tables. Part I. Truth-Tables P Q P Q P Q P P Q P Q

Tables. Part I. Truth-Tables P Q P Q P Q P P Q P Q Tables art I Truth-Tables Q Q Q Q Q 0 0 0 0 1 1 1 0 1 0 1 1 0 1 0 0 1 0 0 0 1 1 1 1 1 1 371 372 TABLES FOR ART I Equiences for connectives Commutativity: Associativity: Q == Q, ( Q) R == (Q R), Q == Q,

More information

a(e, x) = x. Diagrammatically, this is encoded as the following commutative diagrams / X

a(e, x) = x. Diagrammatically, this is encoded as the following commutative diagrams / X 4. Mon, Sept. 30 Lst time, we defined the quotient topology coming from continuous surjection q : X! Y. Recll tht q is quotient mp (nd Y hs the quotient topology) if V Y is open precisely when q (V ) X

More information

UNIT 11. Query Optimization

UNIT 11. Query Optimization UNIT Query Optimiztion Contents Introduction to Query Optimiztion 2 The Optimiztion Process: An Overview 3 Optimiztion in System R 4 Optimiztion in INGRES 5 Implementing the Join Opertors Wei-Png Yng,

More information

MA1008. Calculus and Linear Algebra for Engineers. Course Notes for Section B. Stephen Wills. Department of Mathematics. University College Cork

MA1008. Calculus and Linear Algebra for Engineers. Course Notes for Section B. Stephen Wills. Department of Mathematics. University College Cork MA1008 Clculus nd Liner Algebr for Engineers Course Notes for Section B Stephen Wills Deprtment of Mthemtics University College Cork s.wills@ucc.ie http://euclid.ucc.ie/pges/stff/wills/teching/m1008/ma1008.html

More information

If you are at the university, either physically or via the VPN, you can download the chapters of this book as PDFs.

If you are at the university, either physically or via the VPN, you can download the chapters of this book as PDFs. Lecture 5 Wlks, Trils, Pths nd Connectedness Reding: Some of the mteril in this lecture comes from Section 1.2 of Dieter Jungnickel (2008), Grphs, Networks nd Algorithms, 3rd edition, which is ville online

More information

Theory of Computation CSE 105

Theory of Computation CSE 105 $ $ $ Theory of Computtion CSE 105 Regulr Lnguges Study Guide nd Homework I Homework I: Solutions to the following problems should be turned in clss on July 1, 1999. Instructions: Write your nswers clerly

More information

Chapter 4 Fuzzy Graph and Relation

Chapter 4 Fuzzy Graph and Relation Chpter 4 Fuzzy Grph nd Reltion Grph nd Fuzzy Grph! Grph n G = (V, E) n V : Set of verties(node or element) n E : Set of edges An edge is pir (x, y) of verties in V.! Fuzzy Grph ~ n ( ~ G = V, E) n V :

More information

Day06 A. Young W. Lim Mon. Young W. Lim Day06 A Mon 1 / 16

Day06 A. Young W. Lim Mon. Young W. Lim Day06 A Mon 1 / 16 Day06 A Young W. Lim 2017-09-18 Mon Young W. Lim Day06 A 2017-09-18 Mon 1 / 16 Outline 1 Based on 2 Introduction C Program Control Young W. Lim Day06 A 2017-09-18 Mon 2 / 16 Based on "C How to Program",

More information

LEX5: Regexps to NFA. Lexical Analysis. CMPT 379: Compilers Instructor: Anoop Sarkar. anoopsarkar.github.io/compilers-class

LEX5: Regexps to NFA. Lexical Analysis. CMPT 379: Compilers Instructor: Anoop Sarkar. anoopsarkar.github.io/compilers-class LEX5: Regexps to NFA Lexicl Anlysis CMPT 379: Compilers Instructor: Anoop Srkr noopsrkr.github.io/compilers-clss Building Lexicl Anlyzer Token POern POern Regulr Expression Regulr Expression NFA NFA DFA

More information

In the last lecture, we discussed how valid tokens may be specified by regular expressions.

In the last lecture, we discussed how valid tokens may be specified by regular expressions. LECTURE 5 Scnning SYNTAX ANALYSIS We know from our previous lectures tht the process of verifying the syntx of the progrm is performed in two stges: Scnning: Identifying nd verifying tokens in progrm.

More information

Eulerian Cycle (2A) Young Won Lim 4/26/18

Eulerian Cycle (2A) Young Won Lim 4/26/18 Eulerian Cycle (2A) Copyright (c) 2015 2018 Young W. Lim. Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any

More information

Accessibility (1A) Young Won Lim 8/22/13

Accessibility (1A) Young Won Lim 8/22/13 Accessibility (1A) Copyright (c) 2011-2013 Young W. Lim. Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any

More information

Class (1A) Young Won Lim 9/8/14

Class (1A) Young Won Lim 9/8/14 Class (1A) Copyright (c) 2011-2013 Young W. Lim. Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any later version

More information

CISC 1400 Discrete Structures

CISC 1400 Discrete Structures CISC 1400 Discrete Structures Chapter 4 Relations CISC1400 Yanjun Li 1 1 Relation A relation is a connection between objects in one set and objects in another set (possibly the same set). age is a relation

More information

Day06 A. Young W. Lim Wed. Young W. Lim Day06 A Wed 1 / 26

Day06 A. Young W. Lim Wed. Young W. Lim Day06 A Wed 1 / 26 Day06 A Young W. Lim 2017-09-20 Wed Young W. Lim Day06 A 2017-09-20 Wed 1 / 26 Outline 1 Based on 2 C Program Control Overview for, while, do... while break and continue Relational and Logical Operators

More information

File Manager Quick Reference Guide. June Prepared for the Mayo Clinic Enterprise Kahua Deployment

File Manager Quick Reference Guide. June Prepared for the Mayo Clinic Enterprise Kahua Deployment File Mnger Quick Reference Guide June 2018 Prepred for the Myo Clinic Enterprise Khu Deployment NVIGTION IN FILE MNGER To nvigte in File Mnger, users will mke use of the left pne to nvigte nd further pnes

More information

Unit 5 Vocabulary. A function is a special relationship where each input has a single output.

Unit 5 Vocabulary. A function is a special relationship where each input has a single output. MODULE 3 Terms Definition Picture/Exmple/Nottion 1 Function Nottion Function nottion is n efficient nd effective wy to write functions of ll types. This nottion llows you to identify the input vlue with

More information

COMPUTER EDUCATION TECHNIQUES, INC. (MS_W2K3_SERVER ) SA:

COMPUTER EDUCATION TECHNIQUES, INC. (MS_W2K3_SERVER ) SA: In order to lern which questions hve een nswered correctly: 1. Print these pges. 2. Answer the questions. 3. Send this ssessment with the nswers vi:. FAX to (212) 967-3498. Or. Mil the nswers to the following

More information

Ontological Modeling: Part 8

Ontological Modeling: Part 8 Ontological Modeling: Part 8 Terry Halpin LogicBlox and INTI International University This is the eighth in a series of articles on ontology-based approaches to modeling. The main focus is on popular ontology

More information

Reducing a DFA to a Minimal DFA

Reducing a DFA to a Minimal DFA Lexicl Anlysis - Prt 4 Reducing DFA to Miniml DFA Input: DFA IN Assume DFA IN never gets stuck (dd ded stte if necessry) Output: DFA MIN An equivlent DFA with the minimum numer of sttes. Hrry H. Porter,

More information

Binary Search Tree (3A) Young Won Lim 6/6/18

Binary Search Tree (3A) Young Won Lim 6/6/18 Binary Search Tree (A) //1 Copyright (c) 2015-201 Young W. Lim. Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2

More information

CSE 401 Midterm Exam 11/5/10 Sample Solution

CSE 401 Midterm Exam 11/5/10 Sample Solution Question 1. egulr expressions (20 points) In the Ad Progrmming lnguge n integer constnt contins one or more digits, but it my lso contin embedded underscores. Any underscores must be preceded nd followed

More information

How to Design REST API? Written Date : March 23, 2015

How to Design REST API? Written Date : March 23, 2015 Visul Prdigm How Design REST API? Turil How Design REST API? Written Dte : Mrch 23, 2015 REpresenttionl Stte Trnsfer, n rchitecturl style tht cn be used in building networked pplictions, is becoming incresingly

More information

CSCE 531, Spring 2017, Midterm Exam Answer Key

CSCE 531, Spring 2017, Midterm Exam Answer Key CCE 531, pring 2017, Midterm Exm Answer Key 1. (15 points) Using the method descried in the ook or in clss, convert the following regulr expression into n equivlent (nondeterministic) finite utomton: (

More information

Class (1A) Young Won Lim 11/20/14

Class (1A) Young Won Lim 11/20/14 Class (1A) Copyright (c) 2011 2014 Young W. Lim. Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any later version

More information

NUMERICAL METHODS & OPTIMISATION

NUMERICAL METHODS & OPTIMISATION For updted version, plese click on http://ocw.ump.edu.my NUMERICAL METHODS & OPTIMISATION Prt I: s Rihn Edros Fculty of Engineering Technology rzhirh@ump.edu.my Chpter Description Aims Apply numericl methods

More information

About the Finite Element Analysis for Beam-Hinged Frame. Duan Jin1,a, Li Yun-gui1

About the Finite Element Analysis for Beam-Hinged Frame. Duan Jin1,a, Li Yun-gui1 Advnces in Engineering Reserch (AER), volume 143 6th Interntionl Conference on Energy nd Environmentl Protection (ICEEP 2017) About the Finite Element Anlysis for Bem-Hinged Frme Dun Jin1,, Li Yun-gui1

More information

Binary Search Tree (3A) Young Won Lim 6/2/18

Binary Search Tree (3A) Young Won Lim 6/2/18 Binary Search Tree (A) /2/1 Copyright (c) 2015-201 Young W. Lim. Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2

More information

Introduction to Algebra

Introduction to Algebra INTRODUCTORY ALGEBRA Mini-Leture 1.1 Introdution to Alger Evlute lgeri expressions y sustitution. Trnslte phrses to lgeri expressions. 1. Evlute the expressions when =, =, nd = 6. ) d) 5 10. Trnslte eh

More information

Binary Search Tree (2A) Young Won Lim 5/17/18

Binary Search Tree (2A) Young Won Lim 5/17/18 Binary Search Tree (2A) Copyright (c) 2015-2018 Young W. Lim. Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or

More information

ASTs, Regex, Parsing, and Pretty Printing

ASTs, Regex, Parsing, and Pretty Printing ASTs, Regex, Prsing, nd Pretty Printing CS 2112 Fll 2016 1 Algeric Expressions To strt, consider integer rithmetic. Suppose we hve the following 1. The lphet we will use is the digits {0, 1, 2, 3, 4, 5,

More information

Assignment 4. Due 09/18/17

Assignment 4. Due 09/18/17 Assignment 4. ue 09/18/17 1. ). Write regulr expressions tht define the strings recognized by the following finite utomt: b d b b b c c b) Write FA tht recognizes the tokens defined by the following regulr

More information

Introduction to Computer Engineering EECS 203 dickrp/eecs203/ CMOS transmission gate (TG) TG example

Introduction to Computer Engineering EECS 203  dickrp/eecs203/ CMOS transmission gate (TG) TG example Introduction to Computer Engineering EECS 23 http://ziyng.eecs.northwestern.edu/ dickrp/eecs23/ CMOS trnsmission gte TG Instructor: Robert Dick Office: L477 Tech Emil: dickrp@northwestern.edu Phone: 847

More information

Definition of Regular Expression

Definition of Regular Expression Definition of Regulr Expression After the definition of the string nd lnguges, we re redy to descrie regulr expressions, the nottion we shll use to define the clss of lnguges known s regulr sets. Recll

More information

Stained Glass Design. Teaching Goals:

Stained Glass Design. Teaching Goals: Stined Glss Design Time required 45-90 minutes Teching Gols: 1. Students pply grphic methods to design vrious shpes on the plne.. Students pply geometric trnsformtions of grphs of functions in order to

More information

Deterministic. Finite Automata. And Regular Languages. Fall 2018 Costas Busch - RPI 1

Deterministic. Finite Automata. And Regular Languages. Fall 2018 Costas Busch - RPI 1 Deterministic Finite Automt And Regulr Lnguges Fll 2018 Costs Busch - RPI 1 Deterministic Finite Automton (DFA) Input Tpe String Finite Automton Output Accept or Reject Fll 2018 Costs Busch - RPI 2 Trnsition

More information

Midterm I Solutions CS164, Spring 2006

Midterm I Solutions CS164, Spring 2006 Midterm I Solutions CS164, Spring 2006 Februry 23, 2006 Plese red ll instructions (including these) crefully. Write your nme, login, SID, nd circle the section time. There re 8 pges in this exm nd 4 questions,

More information

CS 441 Discrete Mathematics for CS Lecture 24. Relations IV. CS 441 Discrete mathematics for CS. Equivalence relation

CS 441 Discrete Mathematics for CS Lecture 24. Relations IV. CS 441 Discrete mathematics for CS. Equivalence relation CS 441 Discrete Mathematics for CS Lecture 24 Relations IV Milos Hauskrecht milos@cs.pitt.edu 5329 Sennott Square Equivalence relation Definition: A relation R on a set A is called an equivalence relation

More information

SOME EXAMPLES OF SUBDIVISION OF SMALL CATEGORIES

SOME EXAMPLES OF SUBDIVISION OF SMALL CATEGORIES SOME EXAMPLES OF SUBDIVISION OF SMALL CATEGORIES MARCELLO DELGADO Abstrct. The purpose of this pper is to build up the bsic conceptul frmework nd underlying motivtions tht will llow us to understnd ctegoricl

More information

CMPSC 470: Compiler Construction

CMPSC 470: Compiler Construction CMPSC 47: Compiler Construction Plese complete the following: Midterm (Type A) Nme Instruction: Mke sure you hve ll pges including this cover nd lnk pge t the end. Answer ech question in the spce provided.

More information

5 Regular 4-Sided Composition

5 Regular 4-Sided Composition Xilinx-Lv User Guide 5 Regulr 4-Sided Composition This tutoril shows how regulr circuits with 4-sided elements cn be described in Lv. The type of regulr circuits tht re discussed in this tutoril re those

More information

Algorithms Bubble Sort (1B) Young Won Lim 4/5/18

Algorithms Bubble Sort (1B) Young Won Lim 4/5/18 Algorithms Bubble Sort (1B) Young Won Lim 4/5/18 Copyright (c) 2017 2018 Young W. Lim. Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation

More information

1 Drawing 3D Objects in Adobe Illustrator

1 Drawing 3D Objects in Adobe Illustrator Drwing 3D Objects in Adobe Illustrtor 1 1 Drwing 3D Objects in Adobe Illustrtor This Tutoril will show you how to drw simple objects with three-dimensionl ppernce. At first we will drw rrows indicting

More information

Relations I. Margaret M. Fleck. 7 November 2008

Relations I. Margaret M. Fleck. 7 November 2008 Relations I Margaret M. Fleck 7 November 2008 This lecture covers relations and basic properties of relations, which is most of section 8.1 of Rosen. 1 Announcements Model solutions for the second midterm

More information

arxiv: v2 [math.lo] 20 Nov 2018

arxiv: v2 [math.lo] 20 Nov 2018 Simple Laws about Nonprominent Properties of Binary Relations Jochen Burghardt jochen.burghardt alumni.tu-berlin.de Nov 2018 arxiv:1806.05036v2 [math.lo] 20 Nov 2018 Abstract We checked each binary relation

More information

10.5 Graphing Quadratic Functions

10.5 Graphing Quadratic Functions 0.5 Grphing Qudrtic Functions Now tht we cn solve qudrtic equtions, we wnt to lern how to grph the function ssocited with the qudrtic eqution. We cll this the qudrtic function. Grphs of Qudrtic Functions

More information

Binary Search Tree (3A) Young Won Lim 6/4/18

Binary Search Tree (3A) Young Won Lim 6/4/18 Binary Search Tree (A) /4/1 Copyright (c) 2015-201 Young W. Lim. Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2

More information

Subtracting Fractions

Subtracting Fractions Lerning Enhncement Tem Model Answers: Adding nd Subtrcting Frctions Adding nd Subtrcting Frctions study guide. When the frctions both hve the sme denomintor (bottom) you cn do them using just simple dding

More information

Tixeo compared to other videoconferencing solutions

Tixeo compared to other videoconferencing solutions compred to other videoconferencing solutions for V171026EN , unique solution on the video conferencing field Adobe Connect Web RTC Vydio for High security level, privcy Zero impct on network security policies

More information

About the Tutorial. Audience. Prerequisites. Copyright & Disclaimer. Discrete Mathematics

About the Tutorial. Audience. Prerequisites. Copyright & Disclaimer. Discrete Mathematics About the Tutorial Discrete Mathematics is a branch of mathematics involving discrete elements that uses algebra and arithmetic. It is increasingly being applied in the practical fields of mathematics

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

CS412/413. Introduction to Compilers Tim Teitelbaum. Lecture 4: Lexical Analyzers 28 Jan 08

CS412/413. Introduction to Compilers Tim Teitelbaum. Lecture 4: Lexical Analyzers 28 Jan 08 CS412/413 Introduction to Compilers Tim Teitelum Lecture 4: Lexicl Anlyzers 28 Jn 08 Outline DFA stte minimiztion Lexicl nlyzers Automting lexicl nlysis Jlex lexicl nlyzer genertor CS 412/413 Spring 2008

More information

RATIONAL EQUATION: APPLICATIONS & PROBLEM SOLVING

RATIONAL EQUATION: APPLICATIONS & PROBLEM SOLVING RATIONAL EQUATION: APPLICATIONS & PROBLEM SOLVING When finding the LCD of problem involving the ddition or subtrction of frctions, it my be necessry to fctor some denomintors to discover some restricted

More information

12-B FRACTIONS AND DECIMALS

12-B FRACTIONS AND DECIMALS -B Frctions nd Decimls. () If ll four integers were negtive, their product would be positive, nd so could not equl one of them. If ll four integers were positive, their product would be much greter thn

More information

Power Set of a set and Relations

Power Set of a set and Relations Power Set of a set and Relations 1 Power Set (1) Definition: The power set of a set S, denoted P(S), is the set of all subsets of S. Examples Let A={a,b,c}, P(A)={,{a},{b},{c},{a,b},{b,c},{a,c},{a,b,c}}

More information

Agilent Mass Hunter Software

Agilent Mass Hunter Software Agilent Mss Hunter Softwre Quick Strt Guide Use this guide to get strted with the Mss Hunter softwre. Wht is Mss Hunter Softwre? Mss Hunter is n integrl prt of Agilent TOF softwre (version A.02.00). Mss

More information

CHAPTER 3 FUZZY RELATION and COMPOSITION

CHAPTER 3 FUZZY RELATION and COMPOSITION CHAPTER 3 FUZZY RELATION and COMPOSITION The concept of fuzzy set as a generalization of crisp set has been introduced in the previous chapter. Relations between elements of crisp sets can be extended

More information

Welch Allyn CardioPerfect Workstation Installation Guide

Welch Allyn CardioPerfect Workstation Installation Guide Welch Allyn CrdioPerfect Worksttion Instlltion Guide INSTALLING CARDIOPERFECT WORKSTATION SOFTWARE & ACCESSORIES ON A SINGLE PC For softwre version 1.6.6 or lter For network instlltion, plese refer to

More information

9.5 Equivalence Relations

9.5 Equivalence Relations 9.5 Equivalence Relations You know from your early study of fractions that each fraction has many equivalent forms. For example, 2, 2 4, 3 6, 2, 3 6, 5 30,... are all different ways to represent the same

More information

Misrepresentation of Preferences

Misrepresentation of Preferences Misrepresenttion of Preferences Gicomo Bonnno Deprtment of Economics, University of Cliforni, Dvis, USA gfbonnno@ucdvis.edu Socil choice functions Arrow s theorem sys tht it is not possible to extrct from

More information

LCI/USB LonWorks Commissioning Interface

LCI/USB LonWorks Commissioning Interface Works Commissioning Interfce Importnt: Retin these instructions CONTENTS 1 Unpcking... 1 2 Storing... 1 3 Instlltion... 1 4 Uninstlling the USB Drivers... 8 5 Disposl... 8 1 UNPACKING Instlltion Instructions

More information

Functions (4A) Young Won Lim 5/8/17

Functions (4A) Young Won Lim 5/8/17 Functions (4A) Copyright (c) 2015 Young W. Lim. Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any later version

More information

UNIVERSITY OF EDINBURGH COLLEGE OF SCIENCE AND ENGINEERING SCHOOL OF INFORMATICS INFORMATICS 1 COMPUTATION & LOGIC INSTRUCTIONS TO CANDIDATES

UNIVERSITY OF EDINBURGH COLLEGE OF SCIENCE AND ENGINEERING SCHOOL OF INFORMATICS INFORMATICS 1 COMPUTATION & LOGIC INSTRUCTIONS TO CANDIDATES UNIVERSITY OF EDINBURGH COLLEGE OF SCIENCE AND ENGINEERING SCHOOL OF INFORMATICS INFORMATICS COMPUTATION & LOGIC Sturdy st April 7 : to : INSTRUCTIONS TO CANDIDATES This is tke-home exercise. It will not

More information

A Tautology Checker loosely related to Stålmarck s Algorithm by Martin Richards

A Tautology Checker loosely related to Stålmarck s Algorithm by Martin Richards A Tutology Checker loosely relted to Stålmrck s Algorithm y Mrtin Richrds mr@cl.cm.c.uk http://www.cl.cm.c.uk/users/mr/ University Computer Lortory New Museum Site Pemroke Street Cmridge, CB2 3QG Mrtin

More information

Mid-term exam. Scores. Fall term 2012 KAIST EE209 Programming Structures for EE. Thursday Oct 25, Student's name: Student ID:

Mid-term exam. Scores. Fall term 2012 KAIST EE209 Programming Structures for EE. Thursday Oct 25, Student's name: Student ID: Fll term 2012 KAIST EE209 Progrmming Structures for EE Mid-term exm Thursdy Oct 25, 2012 Student's nme: Student ID: The exm is closed book nd notes. Red the questions crefully nd focus your nswers on wht

More information

Network. Introduction

Network. Introduction A. Mrvar: Network Analysis using Pajek 1 Network Introduction Let U = {X 1,X 2,...,X n } be a finite set of units. Connections among units are described using one or more binary relations R t U U, t =

More information

Processors. Young W. Lim. May 9, 2016

Processors. Young W. Lim. May 9, 2016 Processors Young W. Lim May 9, 2016 Copyright (c) 2016 Young W. Lim. Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version

More information

LINX MATRIX SWITCHERS FIRMWARE UPDATE INSTRUCTIONS FIRMWARE VERSION

LINX MATRIX SWITCHERS FIRMWARE UPDATE INSTRUCTIONS FIRMWARE VERSION Overview LINX MATRIX SWITCHERS FIRMWARE UPDATE INSTRUCTIONS FIRMWARE VERSION 4.3.1.0 Due to the complex nture of this updte, plese fmilirize yourself with these instructions nd then contct RGB Spectrum

More information

PIA INQUIRY QUESTIONS LEASED DARK FIBER AND SPECIAL CONSTRUCTION

PIA INQUIRY QUESTIONS LEASED DARK FIBER AND SPECIAL CONSTRUCTION PIA INQUIRY QUESTIONS LEASED DARK FIBER AND SPECIAL CONSTRUCTION IMPORTANT: The rules for evluting the cost effectiveness of drk fier nd self provisioning options re strict, ever evolving, nd re explined

More information

I BSc(Computer Science)[ ] Semester - II Allied:DISCRETE MATHEMATICS - 207D Multiple Choice Questions.

I BSc(Computer Science)[ ] Semester - II Allied:DISCRETE MATHEMATICS - 207D Multiple Choice Questions. 1 of 23 1/20/2018, 2:35 PM Dr.G.R.Damodaran College of Science (Autonomous, affiliated to the Bharathiar University, recognized by the UGC)Reaccredited at the 'A' Grade Level by the NAAC and ISO 9001:2008

More information

Presentation Martin Randers

Presentation Martin Randers Presenttion Mrtin Rnders Outline Introduction Algorithms Implementtion nd experiments Memory consumption Summry Introduction Introduction Evolution of species cn e modelled in trees Trees consist of nodes

More information

MTH 146 Conics Supplement

MTH 146 Conics Supplement 105- Review of Conics MTH 146 Conics Supplement In this section we review conics If ou ne more detils thn re present in the notes, r through section 105 of the ook Definition: A prol is the set of points

More information

Zenoss Service Impact Installation and Upgrade Guide for Resource Manager 5.x and 6.x

Zenoss Service Impact Installation and Upgrade Guide for Resource Manager 5.x and 6.x Zenoss Service Impct Instlltion nd Upgrde Guide for Resource Mnger 5.x nd 6.x Relese 5.3.1 Zenoss, Inc. www.zenoss.com Zenoss Service Impct Instlltion nd Upgrde Guide for Resource Mnger 5.x nd 6.x Copyright

More information

Introduction Transformation formulae Polar graphs Standard curves Polar equations Test GRAPHS INU0114/514 (MATHS 1)

Introduction Transformation formulae Polar graphs Standard curves Polar equations Test GRAPHS INU0114/514 (MATHS 1) POLAR EQUATIONS AND GRAPHS GEOMETRY INU4/54 (MATHS ) Dr Adrin Jnnett MIMA CMth FRAS Polr equtions nd grphs / 6 Adrin Jnnett Objectives The purpose of this presenttion is to cover the following topics:

More information

CS311H: Discrete Mathematics. Graph Theory IV. A Non-planar Graph. Regions of a Planar Graph. Euler s Formula. Instructor: Işıl Dillig

CS311H: Discrete Mathematics. Graph Theory IV. A Non-planar Graph. Regions of a Planar Graph. Euler s Formula. Instructor: Işıl Dillig CS311H: Discrete Mthemtics Grph Theory IV Instructor: Işıl Dillig Instructor: Işıl Dillig, CS311H: Discrete Mthemtics Grph Theory IV 1/25 A Non-plnr Grph Regions of Plnr Grph The plnr representtion of

More information

such that the S i cover S, or equivalently S

such that the S i cover S, or equivalently S MATH 55 Triple Integrls Fll 16 1. Definition Given solid in spce, prtition of consists of finite set of solis = { 1,, n } such tht the i cover, or equivlently n i. Furthermore, for ech i, intersects i

More information

Functions (4A) Young Won Lim 3/16/18

Functions (4A) Young Won Lim 3/16/18 Functions (4A) Copyright (c) 2015 Young W. Lim. Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any later version

More information

CS314: FORMAL LANGUAGES AND AUTOMATA THEORY L. NADA ALZABEN. Lecture 1: Introduction

CS314: FORMAL LANGUAGES AND AUTOMATA THEORY L. NADA ALZABEN. Lecture 1: Introduction CS314: FORMAL LANGUAGES AND AUTOMATA THEORY L. NADA ALZABEN Lecture 1: Introduction Introduction to the course 2 Required Text Book: INTRODUCTION TO THE THEORY OF COMPUTATION, SECOND EDITION, BY MICHAEL

More information

Variables (2D) Young Won Lim 3/28/18

Variables (2D) Young Won Lim 3/28/18 Variables (2D) Copyright (c) 2014-2018 Young W. Lim. Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any later

More information

Alignment of Long Sequences. BMI/CS Spring 2012 Colin Dewey

Alignment of Long Sequences. BMI/CS Spring 2012 Colin Dewey Alignment of Long Sequences BMI/CS 776 www.biostt.wisc.edu/bmi776/ Spring 2012 Colin Dewey cdewey@biostt.wisc.edu Gols for Lecture the key concepts to understnd re the following how lrge-scle lignment

More information

Product of polynomials. Introduction to Programming (in C++) Numerical algorithms. Product of polynomials. Product of polynomials

Product of polynomials. Introduction to Programming (in C++) Numerical algorithms. Product of polynomials. Product of polynomials Product of polynomils Introduction to Progrmming (in C++) Numericl lgorithms Jordi Cortdell, Ricrd Gvldà, Fernndo Orejs Dept. of Computer Science, UPC Given two polynomils on one vrile nd rel coefficients,

More information

COMPUTER SCIENCE 123. Foundations of Computer Science. 6. Tuples

COMPUTER SCIENCE 123. Foundations of Computer Science. 6. Tuples COMPUTER SCIENCE 123 Foundtions of Computer Science 6. Tuples Summry: This lecture introduces tuples in Hskell. Reference: Thompson Sections 5.1 2 R.L. While, 2000 3 Tuples Most dt comes with structure

More information

EECS 281: Homework #4 Due: Thursday, October 7, 2004

EECS 281: Homework #4 Due: Thursday, October 7, 2004 EECS 28: Homework #4 Due: Thursdy, October 7, 24 Nme: Emil:. Convert the 24-bit number x44243 to mime bse64: QUJD First, set is to brek 8-bit blocks into 6-bit blocks, nd then convert: x44243 b b 6 2 9

More information

ΕΠΛ323 - Θεωρία και Πρακτική Μεταγλωττιστών

ΕΠΛ323 - Θεωρία και Πρακτική Μεταγλωττιστών ΕΠΛ323 - Θωρία και Πρακτική Μταγλωττιστών Lecture 3 Lexicl Anlysis Elis Athnsopoulos elisthn@cs.ucy.c.cy Recognition of Tokens if expressions nd reltionl opertors if è if then è then else è else relop

More information

Lecture 7: Building 3D Models (Part 1) Prof Emmanuel Agu. Computer Science Dept. Worcester Polytechnic Institute (WPI)

Lecture 7: Building 3D Models (Part 1) Prof Emmanuel Agu. Computer Science Dept. Worcester Polytechnic Institute (WPI) Computer Grphics (CS 4731) Lecture 7: Building 3D Models (Prt 1) Prof Emmnuel Agu Computer Science Dept. Worcester Polytechnic Institute (WPI) Stndrd d Unit itvectors Define y i j 1,0,0 0,1,0 k i k 0,0,1

More information

Applications of Arrays (1A) Young Won Lim 2/11/17

Applications of Arrays (1A) Young Won Lim 2/11/17 Copyright (c) 2009-2017 Young W. Lim. Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any later version published

More information

CS 341 Homework 1 Basic Techniques

CS 341 Homework 1 Basic Techniques CS 341 Homework 1 Basic Techniques 1. What are these sets? Write them using braces, commas, numerals, (for infinite sets), and only. (a) ({1, 3, 5} {3, 1}) {3, 5, 7} (b) {{3}, {3, 5}, {{5, 7}, {7, 9}}}

More information

pdfapilot Server 2 Manual

pdfapilot Server 2 Manual pdfpilot Server 2 Mnul 2011 by clls softwre gmbh Schönhuser Allee 6/7 D 10119 Berlin Germny info@cllssoftwre.com www.cllssoftwre.com Mnul clls pdfpilot Server 2 Pge 2 clls pdfpilot Server 2 Mnul Lst modified:

More information

Homework. Context Free Languages III. Languages. Plan for today. Context Free Languages. CFLs and Regular Languages. Homework #5 (due 10/22)

Homework. Context Free Languages III. Languages. Plan for today. Context Free Languages. CFLs and Regular Languages. Homework #5 (due 10/22) Homework Context Free Lnguges III Prse Trees nd Homework #5 (due 10/22) From textbook 6.4,b 6.5b 6.9b,c 6.13 6.22 Pln for tody Context Free Lnguges Next clss of lnguges in our quest! Lnguges Recll. Wht

More information

An Overview of PDF/X. Dov Isaacs Principal Scientist, Workflow & Interoperability Chair, ISO TC130 WG2/TF2, PDF/X April 27, 2011

An Overview of PDF/X. Dov Isaacs Principal Scientist, Workflow & Interoperability Chair, ISO TC130 WG2/TF2, PDF/X April 27, 2011 An Overview of PDF/X Dov Iscs Principl Scientist, Workflow & Interoperbility Chir, ISO TC130 WG2/TF2, PDF/X April 27, 2011 PDF s n Adobe File Formt 1993 to 2008 PDF formt introduced by Adobe with Acrobt

More information

Day05 A. Young W. Lim Sat. Young W. Lim Day05 A Sat 1 / 14

Day05 A. Young W. Lim Sat. Young W. Lim Day05 A Sat 1 / 14 Day05 A Young W. Lim 2017-10-07 Sat Young W. Lim Day05 A 2017-10-07 Sat 1 / 14 Outline 1 Based on 2 Structured Programming (2) Conditions and Loops Conditional Statements Loop Statements Type Cast Young

More information

Math 142, Exam 1 Information.

Math 142, Exam 1 Information. Mth 14, Exm 1 Informtion. 9/14/10, LC 41, 9:30-10:45. Exm 1 will be bsed on: Sections 7.1-7.5. The corresponding ssigned homework problems (see http://www.mth.sc.edu/ boyln/sccourses/14f10/14.html) At

More information

ZZ - Advanced Math Review 2017

ZZ - Advanced Math Review 2017 ZZ - Advnced Mth Review Mtrix Multipliction Given! nd! find the sum of the elements of the product BA First, rewrite the mtrices in the correct order to multiply The product is BA hs order x since B is

More information

10/11/2018. Partial Orderings. Partial Orderings. Partial Orderings. Partial Orderings. Partial Orderings. Partial Orderings

10/11/2018. Partial Orderings. Partial Orderings. Partial Orderings. Partial Orderings. Partial Orderings. Partial Orderings Sometimes, relations define an order on the elements in a set. Definition: A relation R on a set S is called a partial ordering or partial order if it is reflexive, antisymmetric, and transitive. A set

More information