Automaten und Formale Sprachen alias Theoretische Informatik. Sommersemester 2014
|
|
- Johnathan Stokes
- 6 years ago
- Views:
Transcription
1 Automaten und Formale Sprachen alias Theoretische Informatik Sommersemester 2014 Dr. Sander Bruggink Übungsleitung: Jan Stückrath Sander Bruggink Automaten und Formale Sprachen 1
2 Who are we? Teacher: Dr. Sander Bruggink Roomm LF Teaching assistent: Jan Stückrath Room LF Tutors: Lars Stoltenow / Martin Weber Lars Stoltenow: lars.stoltenow@stud.uni-due.de Martin Weber: martin.weber.x@stud.uni-duisburg-essen.de Sander Bruggink Automaten und Formale Sprachen 2
3 Introduction Who are you? BAI ISE Others Website Moodle-Site Sander Bruggink Automaten und Formale Sprachen 3
4 Appointments Lecture: Tuesday, 12pm 2pm, room LB 131 Exercise groups: Group ISE: Tuesday, 8am 10am, Room LE 120 (English) Martin Weber Group BAI-1: Wednesday, 12pm 2pm Uhr, Room LE 120 Lars Stoltenow Group BAI-2: Thursday, 12pm 2pm, Room LF 125 Lars Stoltenow Group BAI-3: Thursday, 4pm 6pm, Room LC 137 Martin Weber Group BAI-4: Friday, 10am 12pm, Room LC 137 Jan Stückrath Sander Bruggink Automaten und Formale Sprachen 4
5 Advice about the exercises Please try to split evenly among the exercise groups. Visit the exercise groups and do the homework. The material of this lecture can only be mastered by frequent practice. Memorizing doesn t help much. The exercise groups start in the third week of the semester. Thus, the first exercise group take place from 22 to 25 April. Sander Bruggink Automaten und Formale Sprachen 5
6 Advice about the exercises The exercise sheet is put online every week on Tuesday at the latest. The written exercises must be handed in on Tuesday, 8am of the following week. In this week the exercise sheet is discussed in the exercise groups. Handing in: in the letter box adjacent to room LF 259. online through Moodle. Plase write clearly your name, student number and group number on your exercise. Also write down the name of the lecture. Sander Bruggink Automaten und Formale Sprachen 6
7 Exam Oral exam in the module Theoretische Informatik ( Automaten und formale Sprachen together with Berechenbarkeit und Komplexität ) For: BAI Students, who started this summer semester, may choose to do the two oral exams of the module separately. Klausur Für: BAI (PO 2012), ISE, Nebenfach Sander Bruggink Automaten und Formale Sprachen 7
8 Bonus points Bonus points: During the semester the will be 12 (or 11) exercise sheets of 20 points each. If you receive 50% of the points, you will recieve one grade level higher (for example 2,0 instead of 2,3) for your exam. You can obtain 10 extra bonus points by publically presenting the answer to an exercise in the exercise group (this is possible only once). For the oral exam of the module Theoretische Informatik you must obtain the bonus in both Automaten und Formale Sprachen and in Berechenbarkeit und Komplexität. Sander Bruggink Automaten und Formale Sprachen 8
9 Literature We use the following book: Uwe Schöning: Theoretische Informatik kurzgefaßt. Spektrum, (5. Auflage) Other relevant literature: Neuauflage eines alten Klassikers: Hopcroft, Motwani, Ullman: Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, Sander Bruggink Automaten und Formale Sprachen 9
10 Literatur Sander Bruggink Automaten und Formale Sprachen 10
11 Motivation / Introduction Informal Overview Automata Finite representations of languages finite automata, pushdown automata, (Turing machines),... Other method to finitely represent languages: grammars, regular expressions and formal languages Language = set of finite sequences of symbols (= words) For example: Set of arithmetical expressions Set of syntactically correct Java programs Set of all German sentences Set of satisfiable logical formulas Sander Bruggink Automaten und Formale Sprachen 11
12 Motivation / Introduction Motivation: Vending Machine Bild: Wikipedia 50 Cent 20 Cent 10 Cent Paying 70 cent with 50, 20 und 10 cent coins. Sander Bruggink Automaten und Formale Sprachen 12
13 Motivation / Introduction Motivation: Vending Machine Automaton: Language: Sequences of coints (from 10, 20, 50 cent), that are wearth 70 cents. Sander Bruggink Automaten und Formale Sprachen 13
14 Motivation / Introduction Adventure-Problem Warming up: we consider the adventure problem, in which an adventurer searches a path through an adventure. (Later we will find out, what this has to do with formal languages.) Sander Bruggink Automaten und Formale Sprachen 14
15 Motivation / Introduction Sander Bruggink Automaten und Formale Sprachen 15
16 Motivation / Introduction Adventure Problem (Level 1) Rules of the Adventure Problem: The Treasure Rule You must find at least two treasures. The Door Rule You can only go through a door, when you found a key before. (The key can be used arbitrarily many times.) Sander Bruggink Automaten und Formale Sprachen 16
17 Motivation / Introduction Adventure Problem (Level 1) The Dragon Rule Immediately after the encounter with a dragon, you must jump into a river, because the dragon will otherwise ignite you. This is not the case anymore, if you have previously found a sword, because then you can kill the dragon. Remark: Dragons, treasures and keys are refilled after you left the according field. We are look for a path from a start to an end state, which satisfies all of the above conditions. Sander Bruggink Automaten und Formale Sprachen 17
18 Motivation / Introduction Adventure Problem (Level 1) Question (Level 1) Is there a solution in the example? Adventure Yes! The shortest solution is: 1, 2, 3, 1, 2, 4, 10, 4, 5, 6, 4, 5, 6, 4, 11, 12 (length 16). Is there a general solving procedure which given an adventure in the form of a graph can always determine whether there is a solution? Yes! We will see this procedure in the lecture. In order to be able to implement this procedure, we need also formal description of the rules (door rule, dragon rule, treasure rule). Sander Bruggink Automaten und Formale Sprachen 18
19 Motivation / Introduction Adventure Problem (Level 2) New Door Rule The keys are magical and disappear immediately after being used to open a door. As soon as you go through a door, the door is locked again. However, you can carry more than one key. Sander Bruggink Automaten und Formale Sprachen 19
20 Motivation / Introduction Adventure Problem (Level 2) Questions (Level 2) Is there a solution in the example? Adventure Yes! The shortest solution is: 1, 2, 3, 1, 2, 4, 10, 4, 7, 8, 9, 4, 7, 8, 9, 4, 11, 12. (length 18) Is there a general solving procedure? Yes! We will see this procedure in the lecture. Why is the new problem harder? We have to count the keys. Sander Bruggink Automaten und Formale Sprachen 20
21 Motivation / Introduction Adventure Problem (Expert Level) New Dragon Rule Swords become unusable by the dragon s blood, as soon as one has killed a dragon. However, dragons are replaced after being killed. Key Regel A magic gate can only be passed, when you don t own a key. Sword Rule A river can only be passed, when you don t have a sword (otherwise, you ll drown). Sander Bruggink Automaten und Formale Sprachen 21
22 Motivation / Introduction Adventure Problem (Expert Level) Questions (Expert Level) Is there a solution in the example? Adventure Yes! The shortest solution is: Ja! Die kürzeste Lösung ist 1, 2, 3, 1, 2, 4, 10, 4, 7, 8, 9, 4, 10, 4, 5, 6, 4, 11, 12. (Länge 19) Is there a general solving procedure? No! It is a so-called undecidable problem. This is not discussed in this lecture, but in Berechenbarkeit und Komplexität. Sander Bruggink Automaten und Formale Sprachen 22
23 Motivation / Introduction Adventure-Problem und Formale Sprachen Automata: Adventure instances Automaton that accepts possible solutions Languages: Possible object sequences of an adventure instance Object sequences that satisy the treasure rule Object sequences that satisy the dragon rule Object sequences that satisy the door rule Sander Bruggink Automaten und Formale Sprachen 23
24 Motivation / Introduction Formal Languages Questions Typical questions here are: Is a language L empty or does it contain (at least) one word? L =? Is a word w in the language? w L? Are two languages included in one another? L 1 L 2? Depending on the language (or languages) these question are either decidable (there is a general procedure to solve the problem) or undecidable Sander Bruggink Automaten und Formale Sprachen 24
25 Motivation / Introduction Adventure Problem and Formal Languages The single levels of the adventure belong to the following language classes: Level 1 regular languages Level 2 context free languages Expert level Chomsky-0 languages (semi-decidable languages) These are discussed in Berechenbarkeit & Komplexität. Sander Bruggink Automaten und Formale Sprachen 25
26 Contents of the Lecture For theoretical computer science How can infinite structures be represented by finite descriptions (automata, grammars)? There are numerous applications for example in the following areas: searching in texts (regular expressions) syntax of (programming) languages and compiler construction modelling system behaviour verification of systems Sander Bruggink Automaten und Formale Sprachen 26
27 Contents of the Lecture Contents of the lecture Automata and formal languages Mathematical foundations and formal proofs Languages, grammars and automata Chomsky Hierarchy (different language classes) Regular languages and context free languages How can we show that a language is not of a certain class? Decision procedures Closure properties (is the intersection of two regular languages also regular?) Sander Bruggink Automaten und Formale Sprachen 27
28 Mathematical Foundations and Formal Proofs Sets Set A set M of elements is denoted as enumerations M = {0, 2, 4, 6, 8,... } or a a set of elements with a certain property General format: M = {n n N and n even} M = {x P(x)} (M is the set of all elements x, which satisfy property P.) Sander Bruggink Automaten und Formale Sprachen 28
29 Mathematical Foundations and Formal Proofs Sets Remarks: The elements of a set a unordered, that is, their order is not important. For example: {1, 2, 3} = {1, 3, 2} = {2, 1, 3} = {2, 3, 1} = {3, 1, 2} = {3, 2, 1} An element cannot occur in a set more than once. It is either in the set, or not. For example: {1, 2, 3} {1, 2, 3, 4} = {1, 2, 3, 4, 4} Sander Bruggink Automaten und Formale Sprachen 29
30 Mathematical Foundations and Formal Proofs Sets Element of a set We write a M, when an element a is contained in the set M. Number of elements of a set For a set M the number of elements of M is denoted by M. Empty set The empty set (set without elements) is denoted by. Subset We write A B when every element of A is also an element of B. A is then called a subset of B. The relation is also called inclusion. Sander Bruggink Automaten und Formale Sprachen 30
31 Mathematical Foundations and Formal Proofs Sets Example: 2 {1, 2, 3}? 2 {1, 2, 3}? {2} {1, 2, 3} {1, 2} {1, 2, 3}? {1, 2} {1, 2, 3}? {A, B, C}? {A, B, C}? Sets can also contain sets: 1 {{1}, {3, 4}}? {1} {{1}, {3, 4}? {1} {{1}, {3, 4}? {{1}} {{1}, {3, 4}? Wichtig: a {a} Sander Bruggink Automaten und Formale Sprachen 31
32 Mathematical Foundations and Formal Proofs Venn-Diagrams Venn-Diagrams are graphical representation of sets and the relationships between them. A B B A Sander Bruggink Automaten und Formale Sprachen 32
33 Mathematical Foundations and Formal Proofs Set operations Union: A B = {e e A oder e B} Intersection: A B = {e e A und e B} Difference: A \ B = {e e A und e / B} A B A B A \ B A B A B A B Sander Bruggink Automaten und Formale Sprachen 33
34 Mathematical Foundations and Formal Proofs Power set Power set Let M be a set. The set P(M) is the set of all subsets of M. P(M) = {A A M} We have: P(M) = 2 M (for a finite set M). Sander Bruggink Automaten und Formale Sprachen 34
35 Mathematical Foundations and Formal Proofs Tuples Tuple Besides sets we also use tuples, which are written with (round) parenthesis: (a 1,..., a n ) In a tuple the elements are ordered. For example: (1, 2, 3) (1, 3, 2) An element can occur multiple times in a tuple. Tuples of different size are always unequal. For example (1, 2, 3, 4) (1, 2, 3, 4, 4) A tuple (a 1,..., a n ) consisting of n elements is called n-tuple. A 2-tupel is also called a pair. Sander Bruggink Automaten und Formale Sprachen 35
36 Mathematical Foundations and Formal Proofs Cross Product Cross product (or cartesian product) Let A, B be two sets. The set A B is the set of all pairs (a, b), where a is an element of A and b an element of B. A B = {(a, b) a A, b B} We have: A B = A B (for finite sets A, B). Sander Bruggink Automaten und Formale Sprachen 36
37 Mathematical Foundations and Formal Proofs Relations Binary relation Let A, B be two sets. A binary relation between A and B is a set of pairs R A B. A B f g A = {f, g, h} B = {1, 2, 3, 4} R = {(f, 1), (f, 2), h R 4 (g, 4), (h, 2)} Sander Bruggink Automaten und Formale Sprachen 37
38 Mathematical Foundations and Formal Proofs The sets A and B can also be equal. Relation over A Let A be a set. A (binary) relation over A is a set of pairs R A A. 2 A A = {1, 2, 3, 4, 5, 6} R = {(1, 3), (1, 2), (2, 6), (3, 6), (4, 4), (5, 1), (5, 5), (5, 6)} Sander Bruggink Automaten und Formale Sprachen 38
39 Mathematical Foundations and Formal Proofs Properties of Relations Let R A A be a elation from A to A. R is reflexive, when for all x A: x R x. a R is irreflexive, when for all x A: not x R x. a Es gibt Relationen die nicht reflexiv aber auch nicht irreflexiv sind. Sander Bruggink Automaten und Formale Sprachen 39
40 Mathematical Foundations and Formal Proofs Properties of Relations (Continued) Let R A A be a elation from A to A. R is symmetric, when for all x, y A it holds, that when x R y, then y R x. a b R is antisymmetric, when for all x, y A it holds, that when x R y and y R x, then x = y. a b (wobei a b) R is transitive, when for x, y, z A it holds that when x R y and y R z, then x R z. a b c Sander Bruggink Automaten und Formale Sprachen 40
DVA325 Formal Languages, Automata and Models of Computation (FABER)
DVA325 Formal Languages, Automata and Models of Computation (FABER) Lecture 1 - Introduction School of Innovation, Design and Engineering Mälardalen University 11 November 2014 Abu Naser Masud FABER November
More information1. The empty set is a proper subset of every set. Not true because the empty set is not a proper subset of itself! is the power set of A.
MAT 101 Solutions to Sample Questions for Exam 1 True or False Questions Answers: 1F, 2F, 3F, 4T, 5T, 6T, 7T 1. The empty set is a proper subset of every set. Not true because the empty set is not a proper
More informationIntroduction To Automata Theory Languages And Computation Addison Wesley Series In Computer Science
Introduction To Automata Theory Languages And Computation Addison Wesley Series In Computer Science INTRODUCTION TO AUTOMATA THEORY LANGUAGES AND COMPUTATION ADDISON WESLEY SERIES IN COMPUTER SCIENCE PDF
More informationBlock 1 - Sets and Basic Combinatorics. Main Topics in Block 1:
Block 1 - Sets and Basic Combinatorics Main Topics in Block 1: A short revision of some set theory Sets and subsets. Venn diagrams to represent sets. Describing sets using rules of inclusion. Set operations.
More informationRemember that represents the set of all permutations of {1, 2,... n}
20180918 Remember that represents the set of all permutations of {1, 2,... n} There are some basic facts about that we need to have in hand: 1. Closure: If and then 2. Associativity: If and and then 3.
More informationSets. Definition A set is an unordered collection of objects called elements or members of the set.
Sets Definition A set is an unordered collection of objects called elements or members of the set. Sets Definition A set is an unordered collection of objects called elements or members of the set. Examples:
More informationPA3 Part 2: BLM List. Workbook 3 - Patterns & Algebra, Part 2 1 BLACKLINE MASTERS
PA Part : BLM List Calendars Colouring Exercise Hanji Puzzles Hundreds Charts 8 Mini Sudoku 9 Sudoku The Real Thing Sudoku Warm Up Venn Diagram BLACKLINE MASTERS Workbook - Patterns & Algebra, Part Calendars
More information1) 1) 2) 2) 3) 3) 4) 4) 5) 5) 6) 6) 7) 7) 8) 8) 9) 9) 10) 10) 11) 11) 12) 12)
Review Test 1 Math 1332 Name SHORT ANSWER. Write the word or phrase that best completes each statement or answers the question. Write a word description of the set. 1) 1) {26, 28, 30, 32,..., 100} List
More informationTechnical framework of Operating System using Turing Machines
Reviewed Paper Technical framework of Operating System using Turing Machines Paper ID IJIFR/ V2/ E2/ 028 Page No 465-470 Subject Area Computer Science Key Words Turing, Undesirability, Complexity, Snapshot
More informationSample Spaces, Events, Probability
Sample Spaces, Events, Probability CS 3130/ECE 3530: Probability and Statistics for Engineers August 28, 2014 Sets A set is a collection of unique objects. Sets A set is a collection of unique objects.
More informationTheory of Probability - Brett Bernstein
Theory of Probability - Brett Bernstein Lecture 3 Finishing Basic Probability Review Exercises 1. Model flipping two fair coins using a sample space and a probability measure. Compute the probability of
More informationAutomata and Formal Languages - CM0081 Turing Machines
Automata and Formal Languages - CM0081 Turing Machines Andrés Sicard-Ramírez Universidad EAFIT Semester 2018-1 Turing Machines Alan Mathison Turing (1912 1954) Automata and Formal Languages - CM0081. Turing
More informationSRM UNIVERSITY FACULTY OF ENGINEERING AND TECHNOLOGY
SRM UNIVERSITY FACULTY OF ENGINEERING AND TECHNOLOGY SCHOOL OF COMPUTER SCIENCE AND ENGINEERING DEPARTMENT OF CSE COURSE PLAN Course Code : CS0204 Course Title : Theory of Computation Semester : IV Course
More informationSets. Gazihan Alankuş (Based on original slides by Brahim Hnich et al.) August 6, Outline Sets Equality Subset Empty Set Cardinality Power Set
Gazihan Alankuş (Based on original slides by Brahim Hnich et al.) August 6, 2012 Gazihan Alankuş (Based on original slides by Brahim Hnich et al.) Gazihan Alankuş (Based on original slides by Brahim Hnich
More informationModeling Supervisory Control of Autonomous Mobile Robots using Graph Theory, Automata and Z Notation
Modeling Supervisory Control of Autonomous Mobile Robots using Graph Theory, Automata and Z Notation Javed Iqbal 1, Sher Afzal Khan 2, Nazir Ahmad Zafar 3 and Farooq Ahmad 1 1 Faculty of Information Technology,
More informationof the hypothesis, but it would not lead to a proof. P 1
Church-Turing thesis The intuitive notion of an effective procedure or algorithm has been mentioned several times. Today the Turing machine has become the accepted formalization of an algorithm. Clearly
More information1 = 3 2 = 3 ( ) = = = 33( ) 98 = = =
Math 115 Discrete Math Final Exam December 13, 2000 Your name It is important that you show your work. 1. Use the Euclidean algorithm to solve the decanting problem for decanters of sizes 199 and 98. In
More informationFinite State Machines CS 64: Computer Organization and Design Logic Lecture #16
Finite State Machines CS 64: Computer Organization and Design Logic Lecture #16 Ziad Matni Dept. of Computer Science, UCSB Lecture Outline Review of Latches vs. FFs Finite State Machines Moore vs. Mealy
More informationFinite and Infinite Sets
Finite and Infinite Sets MATH 464/506, Real Analysis J. Robert Buchanan Department of Mathematics Summer 2007 Basic Definitions Definition The empty set has 0 elements. If n N, a set S is said to have
More informationCITS2211 Discrete Structures Turing Machines
CITS2211 Discrete Structures Turing Machines October 23, 2017 Highlights We have seen that FSMs and PDAs are surprisingly powerful But there are some languages they can not recognise We will study a new
More informationComputability. What can be computed?
Computability What can be computed? Computability What can be computed? read/write tape 0 1 1 0 control Computability What can be computed? read/write tape 0 1 1 0 control Computability What can be computed?
More informationCDT314 FABER Formal Languages, Automata and Models of Computation MARK BURGIN INDUCTIVE TURING MACHINES
CDT314 FABER Formal Languages, Automata and Models of Computation MARK BURGIN INDUCTIVE TURING MACHINES 2012 1 Inductive Turing Machines Burgin, M. Inductive Turing Machines, Notices of the Academy of
More informationCSE 21 Mathematics for Algorithm and System Analysis
CSE 21 Mathematics for Algorithm and System Analysis Unit 1: Basic Count and List Section 3: Set CSE21: Lecture 3 1 Reminder Piazza forum address: http://piazza.com/ucsd/summer2013/cse21/hom e Notes on
More informationSpring 06 Assignment 2: Constraint Satisfaction Problems
15-381 Spring 06 Assignment 2: Constraint Satisfaction Problems Questions to Vaibhav Mehta(vaibhav@cs.cmu.edu) Out: 2/07/06 Due: 2/21/06 Name: Andrew ID: Please turn in your answers on this assignment
More informationGrade 7/8 Math Circles February 21 st /22 nd, Sets
Faculty of Mathematics Waterloo, Ontario N2L 3G1 Sets Grade 7/8 Math Circles February 21 st /22 nd, 2017 Sets Centre for Education in Mathematics and Computing A set is a collection of unique objects i.e.
More informationCounting Techniques, Sets & Venn Diagrams
Counting Techniques, Sets & Venn Diagrams Section 2.1 & 2.2 Cathy Poliak, Ph.D. cathy@math.uh.edu Department of Mathematics University of Houston Lecture 4-2311 Lecture 4-2311 1 / 29 Outline 1 Counting
More informationIt is important that you show your work. The total value of this test is 220 points.
June 27, 2001 Your name It is important that you show your work. The total value of this test is 220 points. 1. (10 points) Use the Euclidean algorithm to solve the decanting problem for decanters of sizes
More informationSlide 1 Math 1520, Lecture 13
Slide 1 Math 1520, Lecture 13 In chapter 7, we discuss background leading up to probability. Probability is one of the most commonly used pieces of mathematics in the world. Understanding the basic concepts
More informationBasic Science for Software Developers
Basic Science for Software Developers David Lorge Parnas, P.Eng. Michael Soltys Department of Computing and Software Faculty of Engineering McMaster University, Hamilton, Ontario, Canada - L8S 4K1 1 Introduction
More informationComputer Science 1001.py. Lecture 25 : Intro to Error Correction and Detection Codes
Computer Science 1001.py Lecture 25 : Intro to Error Correction and Detection Codes Instructors: Daniel Deutch, Amiram Yehudai Teaching Assistants: Michal Kleinbort, Amir Rubinstein School of Computer
More informationReading 14 : Counting
CS/Math 240: Introduction to Discrete Mathematics Fall 2015 Instructors: Beck Hasti, Gautam Prakriya Reading 14 : Counting In this reading we discuss counting. Often, we are interested in the cardinality
More informationImplementation of Recursively Enumerable Languages in Universal Turing Machine
Implementation of Recursively Enumerable Languages in Universal Turing Machine Sumitha C.H, Member, ICMLC and Krupa Ophelia Geddam Abstract This paper presents the design and working of a Universal Turing
More informationAxiomatic Probability
Axiomatic Probability The objective of probability is to assign to each event A a number P(A), called the probability of the event A, which will give a precise measure of the chance thtat A will occur.
More informationACHS Math Team Lecture: Introduction to Set Theory Peter S. Simon
ACHS Math Team Lecture: Introduction to Set Theory Peter S. Simon Introduction to Set Theory A set is a collection of objects, called elements or members of the set. We will usually denote a set by a capital
More informationStat 155: solutions to midterm exam
Stat 155: solutions to midterm exam Michael Lugo October 21, 2010 1. We have a board consisting of infinitely many squares labeled 0, 1, 2, 3,... from left to right. Finitely many counters are placed on
More informationThe Hex game and its mathematical side
The Hex game and its mathematical side Antonín Procházka Laboratoire de Mathématiques de Besançon Université Franche-Comté Lycée Jules Haag, 19 mars 2013 Brief history : HEX was invented in 1942
More informationOracle Turing Machine. Kaixiang Wang
Oracle Turing Machine Kaixiang Wang Pre-background: What is Turing machine Oracle Turing Machine Definition Function Complexity Why Oracle Turing Machine is important Application of Oracle Turing Machine
More informationCS1802 Week 6: Sets Operations, Product Sum Rule Pigeon Hole Principle (Ch )
CS1802 Discrete Structures Recitation Fall 2017 October 9-12, 2017 CS1802 Week 6: Sets Operations, Product Sum Rule Pigeon Hole Principle (Ch 8.5-9.3) Sets i. Set Notation: Draw an arrow from the box on
More informationFinal Exam, Math 6105
Final Exam, Math 6105 SWIM, June 29, 2006 Your name Throughout this test you must show your work. 1. Base 5 arithmetic (a) Construct the addition and multiplication table for the base five digits. (b)
More informationPerry High School. Algebra 2: Week 9. Note: Don t forget to read the sections before or after we cover them. Also, don t forget the website.
Algebra 2: Week 9 Monday: 2.8 Absolute Value Functions Tuesday: 2.8 Work Day Wednesday: Review Exam 2, Day 1 Thursday: Professional Day, NO SCHOOL Friday: Fall Break? NO SCHOOL Note: Don t forget to read
More informationChapter 1 Math Set: a collection of objects. For example, the set of whole numbers is W = {0, 1, 2, 3, }
Chapter 1 Math 3201 1 Chapter 1: Set Theory: Organizing information into sets and subsets Graphically illustrating the relationships between sets and subsets using Venn diagrams Solving problems by using
More informationCS103 Handout 25 Spring 2017 May 5, 2017 Problem Set 5
CS103 Handout 25 Spring 2017 May 5, 2017 Problem Set 5 This problem set the last one purely on discrete mathematics is designed as a cumulative review of the topics we ve covered so far and a proving ground
More informationSpring 06 Assignment 2: Constraint Satisfaction Problems
15-381 Spring 06 Assignment 2: Constraint Satisfaction Problems Questions to Vaibhav Mehta(vaibhav@cs.cmu.edu) Out: 2/07/06 Due: 2/21/06 Name: Andrew ID: Please turn in your answers on this assignment
More informationTHE ENUMERATION OF PERMUTATIONS SORTABLE BY POP STACKS IN PARALLEL
THE ENUMERATION OF PERMUTATIONS SORTABLE BY POP STACKS IN PARALLEL REBECCA SMITH Department of Mathematics SUNY Brockport Brockport, NY 14420 VINCENT VATTER Department of Mathematics Dartmouth College
More informationApplied Statistics I
Applied Statistics I Liang Zhang Department of Mathematics, University of Utah June 12, 2008 Liang Zhang (UofU) Applied Statistics I June 12, 2008 1 / 29 In Probability, our main focus is to determine
More informationProbability (Devore Chapter Two)
Probability (Devore Chapter Two) 1016-351-01 Probability Winter 2011-2012 Contents 1 Axiomatic Probability 2 1.1 Outcomes and Events............................... 2 1.2 Rules of Probability................................
More informationSequential program, state machine, Concurrent process models
INSIGHT Sequential program, state machine, Concurrent process models Finite State Machines, or automata, originated in computational theory and mathematical models in support of various fields of bioscience.
More informationThree of these grids share a property that the other three do not. Can you find such a property? + mod
PPMTC 22 Session 6: Mad Vet Puzzles Session 6: Mad Veterinarian Puzzles There is a collection of problems that have come to be known as "Mad Veterinarian Puzzles", for reasons which will soon become obvious.
More informationMath 127: Equivalence Relations
Math 127: Equivalence Relations Mary Radcliffe 1 Equivalence Relations Relations can take many forms in mathematics. In these notes, we focus especially on equivalence relations, but there are many other
More informationA Learning System for a Computational Science Related Topic
Available online at www.sciencedirect.com Procedia Computer Science 9 (2012 ) 1763 1772 International Conference on Computational Science, ICCS 2012 A Learning System for a Computational Science Related
More informationMathematics Success Grade 8
Mathematics Success Grade 8 T429 [OBJECTIVE] The student will solve systems of equations by graphing. [PREREQUISITE SKILLS] solving equations [MATERIALS] Student pages S207 S220 Rulers [ESSENTIAL QUESTIONS]
More informationMathematical Foundations of Computer Science Lecture Outline August 30, 2018
Mathematical Foundations of omputer Science Lecture Outline ugust 30, 2018 ounting ounting is a part of combinatorics, an area of mathematics which is concerned with the arrangement of objects of a set
More informationOptimal Yahtzee performance in multi-player games
Optimal Yahtzee performance in multi-player games Andreas Serra aserra@kth.se Kai Widell Niigata kaiwn@kth.se April 12, 2013 Abstract Yahtzee is a game with a moderately large search space, dependent on
More information4. Let U = {0, 1, 2, 3, 4, 5, 6, 7, 8, 9}, X = {2, 3, 4}, Y = {1, 4, 5}, Z = {2, 5, 7}. Find a) (X Y) b) X Y c) X (Y Z) d) (X Y) Z
Exercises 1. Write formal descriptions of the following sets. a) The set containing the numbers 1, 10, and 100 b) The set containing all integers that are greater than 5 c) The set containing all natural
More informationSection Introduction to Sets
Section 1.1 - Introduction to Sets Definition: A set is a well-defined collection of objects usually denoted by uppercase letters. Definition: The elements, or members, of a set are denoted by lowercase
More informationLecture 2.3: Symmetric and alternating groups
Lecture 2.3: Symmetric and alternating groups Matthew Macauley Department of Mathematical Sciences Clemson University http://www.math.clemson.edu/~macaule/ Math 4120, Modern Algebra M. Macauley (Clemson)
More informationKINDERGARTEN SUPPLEMENT
KINDERGARTEN SUPPLEMENT Set D7 Measurement: Coins Calendar Pattern Includes March Calendar Pattern D7.1 Skills & Concepts H identify pennies, nickels, dimes, and quarters by name and worth H describe and
More informationEENG 444 / ENAS 944 Digital Communication Systems
EENG 444 / ENAS 944 Digital Communication Systems Introduction!! Wenjun Hu Communication Systems What s the first thing that comes to your mind? Communication Systems What s the first thing that comes
More informationTOPOLOGY, LIMITS OF COMPLEX NUMBERS. Contents 1. Topology and limits of complex numbers 1
TOPOLOGY, LIMITS OF COMPLEX NUMBERS Contents 1. Topology and limits of complex numbers 1 1. Topology and limits of complex numbers Since we will be doing calculus on complex numbers, not only do we need
More information5.1 State-Space Search Problems
Foundations of Artificial Intelligence March 7, 2018 5. State-Space Search: State Spaces Foundations of Artificial Intelligence 5. State-Space Search: State Spaces Malte Helmert University of Basel March
More informationProblem Set 8 Solutions R Y G R R G
6.04/18.06J Mathematics for Computer Science April 5, 005 Srini Devadas and Eric Lehman Problem Set 8 Solutions Due: Monday, April 11 at 9 PM in Room 3-044 Problem 1. An electronic toy displays a 4 4 grid
More informationCSE 355: Human-aware Robo.cs Introduction to Theoretical Computer Science
CSE 355: Introduction to Theoretical Computer Science Instructor: Dr. Yu ( Tony ) Zhang Lecture: WGHL101, Tue/Thu, 3:00 4:15 PM Office Hours: BYENG 594, Tue/Thu, 5:00 6:00PM 1 Subject of interest? 2 Robo.cs
More informationCOMPUTER SCIENCE AND ENGINEERING
COMPUTER SCIENCE AND ENGINEERING Department of Computer Science and Engineering College of Engineering CSE 100 Computer Science as a Profession Fall, Spring. 1(1-0) RB: High school algebra; ability to
More informationUniversity of Wisconsin-Madison, Nelson Institute for Environmental Studies September 2, 2014
University of Wisconsin-Madison, Nelson Institute for Environmental Studies September 2, 2014 The Earth from Above Introduction to Environmental Remote Sensing Lectures: Tuesday, Thursday 2:30-3:45 pm,
More informationSurreal Numbers and Games. February 2010
Surreal Numbers and Games February 2010 1 Last week we began looking at doing arithmetic with impartial games using their Sprague-Grundy values. Today we ll look at an alternative way to represent games
More informationMath 3012 Applied Combinatorics Lecture 2
August 20, 2015 Math 3012 Applied Combinatorics Lecture 2 William T. Trotter trotter@math.gatech.edu The Road Ahead Alert The next two to three lectures will be an integrated approach to material from
More informationOn uniquely k-determined permutations
On uniquely k-determined permutations Sergey Avgustinovich and Sergey Kitaev 16th March 2007 Abstract Motivated by a new point of view to study occurrences of consecutive patterns in permutations, we introduce
More informationClass 8 - Sets (Lecture Notes)
Class 8 - Sets (Lecture Notes) What is a Set? A set is a well-defined collection of distinct objects. Example: A = {1, 2, 3, 4, 5} What is an element of a Set? The objects in a set are called its elements.
More informationChapter 1. Set Theory
Chapter 1 Set Theory 1 Section 1.1: Types of Sets and Set Notation Set: A collection or group of distinguishable objects. Ex. set of books, the letters of the alphabet, the set of whole numbers. You can
More informationMATHEMATICS 152, FALL 2004 METHODS OF DISCRETE MATHEMATICS Outline #10 (Sets and Probability)
MATHEMATICS 152, FALL 2004 METHODS OF DISCRETE MATHEMATICS Outline #10 (Sets and Probability) Last modified: November 10, 2004 This follows very closely Apostol, Chapter 13, the course pack. Attachments
More informationCardinality. Hebrew alphabet). We write S = ℵ 0 and say that S has cardinality aleph null.
Section 2.5 1 Cardinality Definition: The cardinality of a set A is equal to the cardinality of a set B, denoted A = B, if and only if there is a one-to-one correspondence (i.e., a bijection) from A to
More informationGraphs of Tilings. Patrick Callahan, University of California Office of the President, Oakland, CA
Graphs of Tilings Patrick Callahan, University of California Office of the President, Oakland, CA Phyllis Chinn, Department of Mathematics Humboldt State University, Arcata, CA Silvia Heubach, Department
More informationWhy Church s Thesis Still Holds
MICHAEL PRASSE PETER RITTGEN Why Church s Thesis Still Holds Some Notes on Peter Wegner s Tracts on Interaction and Computability Dezember 1997 Arbeitsberichte des Instituts für Wirtschaftsinformatik Nr.8
More informationThe Tilings of Deficient Squares by Ribbon L-Tetrominoes Are Diagonally Cracked
Open Journal of Discrete Mathematics, 217, 7, 165-176 http://wwwscirporg/journal/ojdm ISSN Online: 2161-763 ISSN Print: 2161-7635 The Tilings of Deficient Squares by Ribbon L-Tetrominoes Are Diagonally
More informationLecture 20 November 13, 2014
6.890: Algorithmic Lower Bounds: Fun With Hardness Proofs Fall 2014 Prof. Erik Demaine Lecture 20 November 13, 2014 Scribes: Chennah Heroor 1 Overview This lecture completes our lectures on game characterization.
More informationSenior Math Circles February 10, 2010 Game Theory II
1 University of Waterloo Faculty of Mathematics Centre for Education in Mathematics and Computing Senior Math Circles February 10, 2010 Game Theory II Take-Away Games Last Wednesday, you looked at take-away
More informationMAT 1160 Mathematics, A Human Endeavor
MAT 1160 Mathematics, A Human Endeavor Syllabus: office hours, grading Schedule (note exam dates) Academic Integrity Guidelines Homework & Quizzes Course Web Site : www.eiu.edu/ mathcs/mat1160/ 2005 09,
More informationPattern Avoidance in Unimodal and V-unimodal Permutations
Pattern Avoidance in Unimodal and V-unimodal Permutations Dido Salazar-Torres May 16, 2009 Abstract A characterization of unimodal, [321]-avoiding permutations and an enumeration shall be given.there is
More informationSummer Math Calendar Third Grade
Summer Math Calendar Third Grade Get ready to discover math all around you this summer! Just as teachers encourage students to continue reading throughout the summer to solidify and retain reading skills,
More informationProblem Set 8 Solutions R Y G R R G
6.04/18.06J Mathematics for Computer Science April 5, 005 Srini Devadas and Eric Lehman Problem Set 8 Solutions Due: Monday, April 11 at 9 PM in oom 3-044 Problem 1. An electronic toy displays a 4 4 grid
More informationOlympiad Combinatorics. Pranav A. Sriram
Olympiad Combinatorics Pranav A. Sriram August 2014 Chapter 2: Algorithms - Part II 1 Copyright notices All USAMO and USA Team Selection Test problems in this chapter are copyrighted by the Mathematical
More information2. Nine points are distributed around a circle in such a way that when all ( )
1. How many circles in the plane contain at least three of the points (0, 0), (0, 1), (0, 2), (1, 0), (1, 1), (1, 2), (2, 0), (2, 1), (2, 2)? Solution: There are ( ) 9 3 = 8 three element subsets, all
More information22c181: Formal Methods in Software Engineering. The University of Iowa Spring Propositional Logic
22c181: Formal Methods in Software Engineering The University of Iowa Spring 2010 Propositional Logic Copyright 2010 Cesare Tinelli. These notes are copyrighted materials and may not be used in other course
More informationThe Problem. Tom Davis December 19, 2016
The 1 2 3 4 Problem Tom Davis tomrdavis@earthlink.net http://www.geometer.org/mathcircles December 19, 2016 Abstract The first paragraph in the main part of this article poses a problem that can be approached
More informationKINDERGARTEN SUPPLEMENT
KINDERGARTEN SUPPLEMENT Set D7 Measurement: Coins Calendar Pattern Includes March Calendar Pattern D7.1 Skills & Concepts H identify pennies, nickels, dimes, and quarters by name and worth H describe and
More informationUnit 2: Algorithm Development. Flowcharts
Unit 2: Algorithm Development Flowcharts Vocab Quiz Unit 1 Warm Up: Get out a scratch piece of paper (I have some by the pencil sharpener if you need) 1. Draw a dot in the center of the page. 2. Starting
More informationIntroductory Probability
Introductory Probability Combinations Nicholas Nguyen nicholas.nguyen@uky.edu Department of Mathematics UK Agenda Assigning Objects to Identical Positions Denitions Committee Card Hands Coin Toss Counts
More informationCOMPSCI 372 S2 C Computer Graphics
COMPSCI 372 S2 C Computer Graphics Burkhard Wünsche 1, Christof Lutteroth 2 1 Graphics Group 2 Software Innovation Research Group IMPORTANT ANNOUNCEMENT Departmental Policy on Cheating on Assignments 1.
More informationGrade 6 Math Circles March 8-9, Modular Arithmetic
Faculty of Mathematics Waterloo, Ontario N2L 3G Centre for Education in Mathematics and Computing Grade 6 Math Circles March 8-9, 26 Modular Arithmetic Introduction: The 2-hour Clock Question: If its 7
More informationElko County School District 5 th Grade Math Learning Targets
Elko County School District 5 th Grade Math Learning Targets Nevada Content Standard 1.0 Students will accurately calculate and use estimation techniques, number relationships, operation rules, and algorithms;
More informationContents: 30 Workers in 5 colors. 5 Money tiles. 1 Plantation market. 30 Landscape tiles. 15 Building site tiles. 90 Plantation tiles
Contents: 5 Player mats 30 Workers in 5 colors 1 Double-sided game board 5 Money tiles 1 Plantation market 30 Landscape tiles 90 Plantation tiles (18 of each type: lemon, orange, blood orange, lime, grapefruit
More informationComputability of Tilings
Computability of Tilings Grégory Lafitte and Michael Weiss Abstract Wang tiles are unit size squares with colored edges. To know whether a given finite set of Wang tiles can tile the plane while respecting
More informationGRADE 1 SUPPLEMENT. December Calendar Pattern C4.1
GRADE 1 SUPPLEMENT Set C4 Geometry: Symmetry Calendar Pattern Includes December Calendar Pattern C4.1 Skills & Concepts H recognize and create shapes that are congruent or have symmetry H identify a line
More informationTaffy Tangle. cpsc 231 assignment #5. Due Dates
cpsc 231 assignment #5 Taffy Tangle If you ve ever played casual games on your mobile device, or even on the internet through your browser, chances are that you ve spent some time with a match three game.
More informationInstructor Notes for Chapter 4
Section 4.1 One to One Functions (Day 1) Instructor Notes for Chapter 4 Understand that an inverse relation undoes the original Understand why the line y = xis a line of symmetry for the graphs of relations
More informationCS1802 Week 6: Sets Operations, Product Sum Rule Pigeon Hole Principle (Ch )
CS1802 Discrete Structures Recitation Fall 2017 October 9-12, 2017 CS1802 Week 6: Sets Operations, Product Sum Rule Pigeon Hole Principle (Ch 8.5-9.3) Sets i. Set Notation: Draw an arrow from the box on
More informationAdvanced Automata Theory 4 Games
Advanced Automata Theory 4 Games Frank Stephan Department of Computer Science Department of Mathematics National University of Singapore fstephan@comp.nus.edu.sg Advanced Automata Theory 4 Games p. 1 Repetition
More informationRTV 4929C (Spring 2016) ADVANCED PRODUCTION WORKSHOP: DIRECTING DRAMA
RTV 4929C (Spring 2016) ADVANCED PRODUCTION WORKSHOP: DIRECTING DRAMA Instructor: James Babanikos, Ph.D. Office: 3064 Weimer Hall Office Phone: 392-6399 e-mail: jbabanikos@jou.ufl.edu Office Hours: Tuesdays
More informationGame Theory and Algorithms Lecture 19: Nim & Impartial Combinatorial Games
Game Theory and Algorithms Lecture 19: Nim & Impartial Combinatorial Games May 17, 2011 Summary: We give a winning strategy for the counter-taking game called Nim; surprisingly, it involves computations
More informationFoundations of Artificial Intelligence
Foundations of Artificial Intelligence 20. Combinatorial Optimization: Introduction and Hill-Climbing Malte Helmert Universität Basel April 8, 2016 Combinatorial Optimization Introduction previous chapters:
More information