Review of Mathematical Notation / Terminology

Slides:



Advertisements
Similar presentations
Mathematical Preliminaries
Advertisements

Chapter 2 Revision of Mathematical Notations and Techniques
Basic Structures: Sets, Functions, Sequences, Sums, and Matrices
Basic Structures: Sets, Functions, Sequences, Sums, and Matrices
CSE 20 – Discrete Mathematics Dr. Cynthia Bailey Lee Dr. Shachar Lovett Peer Instruction in Discrete Mathematics by Cynthia Leeis licensed under a Creative.
Discussion #25 1/13 Discussion #25 Set Topics & Applications.
CS 310 – Fall 2006 Pacific University Theoretical Computer Science CS 310 Chadd Williams Office Mon 3:00 – 4:00 PM 202 Strain.
CS5371 Theory of Computation Lecture 1: Mathematics Review I (Basic Terminology)
CS 310 – Fall 2006 Pacific University Theoretical Computer Science CS 310 Chadd Williams Office Mon 10:30-11:30 am 202 Strain.
Costas Busch - RPI1 Mathematical Preliminaries. Costas Busch - RPI2 Mathematical Preliminaries Sets Functions Relations Graphs Proof Techniques.
Courtesy Costas Busch - RPI1 Mathematical Preliminaries.
Theoretical Computer Science COMP 335 Fall 2004
Equivalence Relations: Selected Exercises
SETS A set B is a collection of objects such that for every object X in the universe the statement: “X is a member of B” Is a proposition.
1 CSCI 2400 section 3 Models of Computation Instructor: Costas Busch.
 2004 SDU Introduction to the Theory of Computation My name: 冯好娣 My office: 计算中心 430
CS355 - Theory of Computation Lecture 2: Mathematical Preliminaries.
Introduction Chapter 0. Three Central Areas 1.Automata 2.Computability 3.Complexity.
INTRODUCTION TO THE THEORY OF COMPUTATION INTRODUCTION MICHAEL SIPSER, SECOND EDITION 1.
Mathematical Preliminaries Strings and Languages Preliminaries 1.
Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. Sets.
Mathematical preliminaries Episode 2 0 Sets Sequences Functions Relations Strings.
INM175 Topic 7 1 Module INM175 Discrete Mathematics Topic 7 Set Theoretic Models.
Discrete Math for CS Binary Relation: A binary relation between sets A and B is a subset of the Cartesian Product A x B. If A = B we say that the relation.
Mathematical Preliminaries (Hein 1.1 and 1.2) Sets are collections in which order of elements and duplication of elements do not matter. – {1,a,1,1} =
CSCI 2670 Introduction to Theory of Computing Instructor: Shelby Funk.
Mathematical Preliminaries. Sets Functions Relations Graphs Proof Techniques.
Fall 2005Costas Busch - RPI1 Mathematical Preliminaries.
Prof. Busch - LSU1 Mathematical Preliminaries. Prof. Busch - LSU2 Mathematical Preliminaries Sets Functions Relations Graphs Proof Techniques.
Sets Define sets in 2 ways  Enumeration  Set comprehension (predicate on membership), e.g., {n | n  N   k  k  N  n = 10  k  0  n  50} the set.
Discrete Structure Sets. 2 Set Theory Set: Collection of objects (“elements”) a  A “a is an element of A” “a is a member of A” a  A “a is not an element.
Formal Semantics of Programming Languages 虞慧群 Topic 1: Introduction.
Theory of Computation, Feodor F. Dragan, Kent State University 1 TheoryofComputation Spring, 2015 (Feodor F. Dragan) Department of Computer Science Kent.
CSE 20: Discrete Mathematics for Computer Science Prof. Shachar Lovett.
1 12/2/2015 MATH 224 – Discrete Mathematics Formally a graph is just a collection of unordered or ordered pairs, where for example, if {a,b} G if a, b.
COSC 2007 Data Structures II Chapter 14 Graphs I.
Mathematical Preliminaries
1 RELATIONS Learning outcomes Students are able to: a. determine the properties of relations – reflexive, symmetric, transitive, and antisymmetric b. determine.
Introduction Episode 0 What is TOC (Theory of Computation) about? Giorgi Japaridze Theory of Computability Subject: The fundamental mathematical properties.
Graphs A graphs is an abstract representation of a set of objects, called vertices or nodes, where some pairs of the objects are connected by links, called.
1 Mathematical Preliminaries. 2 Sets Functions Relations Graphs Proof Techniques.
Donghyun (David) Kim Department of Mathematics and Physics North Carolina Central University 1 Chapter 0 Introduction Some slides are in courtesy of Prof.
Set Theory Concepts Set – A collection of “elements” (objects, members) denoted by upper case letters A, B, etc. elements are lower case brackets are used.
CSCI 115 Course Review.
Theory of Computing Topics Formal languages automata computability and related matters Purposes To know the foundations and principles of computer science.
Theory of Computing Topics Formal languages automata computability and related matters Purposes To know the foundations and principles of computer science.
Chapter 2 1. Chapter Summary Sets (This Slide) The Language of Sets - Sec 2.1 – Lecture 8 Set Operations and Set Identities - Sec 2.2 – Lecture 9 Functions.
L ECTURE 3 T HEORY OF AUTOMATA. E QUIVALENT R EGULAR E XPRESSIONS Definition Two regular expressions are said to be equivalent if they generate the same.
English for Economic Informatics I Tomáš Foltýnek Theoretical Foundations of Informatics.
Discrete Structures Li Tak Sing( 李德成 ) Lectures
CSE 20: Discrete Mathematics for Computer Science Prof. Shachar Lovett.
Binary Relation: A binary relation between sets A and B is a subset of the Cartesian Product A x B. If A = B we say that the relation is a relation on.
Equivalence Relations: Selected Exercises
Foundations of Computing Science
Introduction Chapter 0.
BCS2143 – Theory of Computer Science
Introduction to the Theory of Computation
Formal Modeling Concepts
Computer Science Department
Functions FUNCTIONS AND THEIR GRAPHS Essential Questions:
INTRODUCTION TO THE THEORY OF COMPUTATION
CSCI-2400 Models of Computation.
Mathematical Preliminaries Strings and Languages
Mathematical Preliminaries
MCS680: Foundations Of Computer Science
Introduction Chapter 0.
Chapter 1 Introduction to the Theory of Computation
Equivalence Relations: Selected Exercises
Introductory Material
Terminology and Symbols
Presentation transcript:

Review of Mathematical Notation / Terminology Sets, Venn Diagrams, Sequences, Tuples, Functions, Relations, Graphs, Strings, Languages, Boolean Logic

Sets Order doesn’t matter In a set, repeats are “not allowed” {7, 6, 5} and {5, 6, 7} are the same. In a set, repeats are “not allowed” {7, 7} is really {7}, i.e., they describe the same set. In a multiset, repeats are allowed {7, 7} and {7} are different

Sets Empty set notation? Union Intersection Compliment Set Difference?

Venn Diagrams Starts with… Ends with.. Contains… Questions…

Sequences Like sets, but the order matters and repeats are “allowed” (5, 4, 7) is a different sequence than (4, 5, 7), but they would be the same set. (5, 5, 5, 6) is a different sequence than (5, 5, 6) but they are the same set.

Tuples Its just another way of describing sequences. 2-tuple is a pair 3-tuple is a trio Question: If A = {1,2} and B= {x,y,z} what is A X B? X is the Cartesian product. Note: This will create a set of pairs, 2-tuples, or sequences of size 2.

Power Set A = {0, 1, 2} Power set of A is { {}, {0}, {1}, {2}, {0,1}, {1,2}, {2,0}, {0,1,2}} “Power Sequence” of A is { (), (0), (1), (2), (0,1), (1,0), (1,2), (2,1)… (0,1,2), (1,2,0), (2,0,1), (2,1,0), …) Question: What is the size of the set above?

Functions f(a) = b Also called a mapping Function: Domain  Range Abs: Z  Z Add: Z X Z  Z Division: Z X Z  Rational Numbers Question: Example 0.8, 0.9, and 0.10

Relation Function whose Range is {TRUE, FALSE} is called a Predicate Predicate whose Domain is a tuple is called a Relation. If the Domain is a 2-tuple or pair, then its called a Binary Relation Example: Equality of two numbers Java: a == b or a.equals(b) f(a,b) = true if a equals b, otherwise false aRb, where R is the equality Relation F: Z X Z  {TRUE, FALSE}

Equivalence Relation Satisfies three conditions Reflexive: xRx is always true Symmetric: if xRy is true, then yRx is true Transitive: if xRy and yRz are true, then xRz is true. Problems: Are the following Relations equivalence relations: Equality x == y Less-than x < y F(x,y) = true if x+y is even, otherwise false

Graphs Directed vs. undirected Nodes/vertices Edges Degree Labeled graph Sub-graph Path Cycle Simple cycle Tree Root node Leaf nodes Strongly connected directed graphs

Languages Alphabet notation No quotes Empty string Substring Concatenation Lexiographic ordering

Boolean Logic And Or Not XOR Distributive law