# In the following there are presented four different kinds of simulation games for a given Büchi automaton A = :

Save this PDF as:

Size: px
Start display at page:

Download "In the following there are presented four different kinds of simulation games for a given Büchi automaton A = :"

## Transcription

1 Simultion Gmes Motivtion There re t lest two distinct purposes for which it is useful to compute simultion reltionships etween the sttes of utomt. Firstly, with the use of simultion reltions it is possile to mimick the ehviour of nother utomton nd lso to estlish lnguge continment mong nondeterministic utomt. Secondly, simultion reltions cn e used to reduce the stte spce of n utomton y otining its quotient with respect to the equivlence reltion underlying the simultion preorder. 4 Different kinds of simultions In the following there re presented four different kinds of simultion gmes for given Büchi utomton A = : 1) The ordinry simultion gme, denoted, 2) The direct (strong) simultion gme, denoted, 3) The delyed simultion gme, denoted, 4) The fir simultion gme, denoted. Ech of the gmes is plyed y two plyers, Spoiler nd Duplictor, in rounds s follows. At the strt, round 0, two peles, Red nd Blue, re plced on the two vertices q 0 nd q 0. Then Spoiler chooses trnsition nd moves Red to q i+1. Duplictor, responding, must choose trnsition nd moves Blue to q i+1. Here it cn e the cse tht no -trnsition strting from q i exists. In this cse the gme hlts nd Spoiler wins. Either the gme hlts, in which cse Spoiler wins, or the gmes produces two infinite runs: nd, uilt from the trnsitions tken y the two peles. For ech of the 4 simultion gmes there exist different rules to determine the winner: 1.) Ordinry simultion: Duplictor wins in ny cse s long s the gme does not hlt. (Firness conditions re ignored) 2.) Direct simultion: Duplictor wins, iff, for ll i, if, then lso 3.) Delyed simultion: Duplictor wins, iff, for ll i, if, then there exists j i such tht 4.) Fir simultion: Duplictor wins iff there re infinitely mny j such tht or there re only finitely mny i such tht A strtegy for Duplictor in one of the 4 simultion gmes from ove is function: which, given the history of the gme (ctully the choices of Spoiler) up to certin point, determines the next move of Duplictor. A strtegy f for Duplictor is winning strtegy if, no mtter how Spoiler plys, Duplictor lwys wins.

2 Simultion Reltion A stte q ordinry, direct, delyed, fir simultes stte q if there is winning strtegy for Duplictor. The simultion reltion, reflexive, trnsitive reltion (preorder or qusi-order), is denoted y, where * stnds for one of the 4 simultions ordinry(o), direct(di), delyed(de) nd fir(f). The reltions re ordered y continment: For direct, delyed nd fir holds: if then. Bisimultion Reltions For ll the mentioned simultions there re corresponding notions of isimultion, defined vi modifiction of the simultion gmes. The isimultion gme differs from the simultion gme in tht Spoiler gets to choose in ech round which of the two peles, Red or Blue, to move nd Duplictor hs to respond with the move of the other pele. Bisimultions define the following equivlence reltion continment: For isimultions there re lso winning rules for the isimultion gmes tht re similr to the rules for the 4 different simultion gmes: 1.) Ordinry: the sme rules s for the ordinry simultion gme 2.) Fir: If n ccept stte ppers infinitely often on one of the two runs π nd π, then n ccept stte must pper infinitely often on the other s well. 3.) Delyed: If n ccept stte is seen t position i of either run, then n ccept stte must e seen therefter t some position j i of the other run. 4.) Direct: If n ccept stte is seen t position i of either run, it must e seen t position I of oth runs. Quotienting A mjor motivtion for studying reltions is stte-spce reduction, the sic ide eing tht sttes tht simulte ech other re merged leding to reduction of the numer of sttes. This process is usully clled quotienting. Quotienting with respect to delyed simultion preserves the recognized lnguge, ut this is not true for with fir simultion s we will see lter on. For Büchi utomton A, nd n equivlence reltion on the sttes of A, let [q] denote the equivlence clss of with respect to. The quotient of A with respect to is the utomton, where For pplying the simultion reltions, corresponding to ech simultion preorder, n equivlence reltion o, di, de, f is defined, where, iff nd. The quotient with respect to di, de preserves the lnguge of ny utomton.

3 An exmple shows quotienting for delyed simultion. In this exmple oth utomt, the originl one nd the quotient, ccept the sme lnguge. Quotienting y delyed The otined quotient is smller thn the originl utomton nd ccepts the sme lnguge s the first one. The sttes round the middle stte re in one equivlence clss, ecuse one cn sty there with infinitely mny s. With one comes to nother stte nd there, if reding gin nother, one comes to the first stte. Whenever Spoilers mkes n -move, Duplictor cn mke one s well. If Spoiler then mkes -move to the outside, Duplictor nswers with move to the upper ccepting stte. In this cse Duplictor visits infinitely often n ccepting stte nd everything is fine. Thus the quotient utomton hs only two sttes. The quotient with respect to o, f does not preserve the lnguge of ny utomton, which is shown in the exmple elow:, Quotienting y fir, Quotienting is done in this exmple vi the equivlence reltion q f q tht holds for ll sttes q, q from the set Q. The left utomton is ccepting words with nd infinitely lternting. The right utomton ccepts words like ω or ω, ut the originl utomton doesn t.

4 So here it cn e seen, tht the quotient of the originl utomton with respect to f does not preserve the lnguge of the originl utomton. Prity Gmes A prity gme grph hs two disjoint sets of vertices V 0 nd V 1, whose union is V. It lso hs n edge set nd priority function tht ssigns priority to ech vertex. Such prity gme is plyed y two plyers, Zero nd One. The ply strts y plcing pele on vertex v 0. Therefter, the pele is moved ccording to the following rule: With the pele currently on vertex v i nd, Zero (One, respectively) plys nd moves the pele to neighour v i+1, such tht. If ever the rule ove cnnot e pplied, i.e., someone cn t move ecuse there re no outgoing edges, the gme ends nd the plyer who cnnot move loses. Otherwise, the gme goes on forever, nd defines pth, clled ply of the gme. The winner of the gme is determined s follows. Let k π e the minimum priority tht occurs infinitely often in the ply π; Zero wins if k π is even, wheres One wins if k π is odd. Now the gme grphs G * A re uilt, following the sme generl pttern, with some minor ltertions. The first gme grph will e with only three priorities (0,1,2). Formlly G f A is defined y The set of vertices for Zero:, This set of vertices contins ll vertices, where Spoiler hs moved the turn efore nd it is now Duplictor s turn to imitte the lel on the 3 rd position of the tupel, ecuse Spoiler hs tken this lel the move efore. So this lel rememers the move of Spoiler, q is the position of the Spoiler-pele nd q is the position of the Duplictor-pele. The set of vertices for One:, This set of vertices contins ll vertices, where Duplictor hs moved the turn efore nd it is now Spoiler s turn. Here is no 3 rd position in the tupel, ecuse Spoiler does not hve to imitte run move from Duplictor, tht hs to nswer to the moves of Spoiler. The set of the edges for Zero nd One:, The moves of the first set re the moves of Duplictor. Duplictor is in stte v(q 1,q 1,) nd hs to tke trnsition with lel to move from stte q 1 to stte q 2 if there exists the trnsition (q 1,, q 2 ). Only the stte of Duplictor chnges here, the Spoiler s stte q 1 remins the sme. The second set contins ll the moves of Spoiler. Spoiler s in stte v(q 1,q 1 ) nd cn choose ny trnsition (q 1,,q 2 ) form the trnsition set to move his pele to nother stte. In this cse only the Spoiler s stte is chnged.

5 The priority function:. This function mens, tht if neither Spoiler nor Duplictor hve infinitely often n ccepting stte in their runs tht the minimum prity numer tht occurs infinitely often is the 2. In this cse Duplictor wins. If Spoiler hs seen infinitely often n ccept stte ut not Duplictor, the minimum prity numer tht occurs infinitely often is the 1 nd so in this cse Spoiler wins. Lst ut not lest, if Duplictor sees infinitely often n ccepting stte no mtter wht Spoiler does, the minimum prity numer occurring is the 0 nd here lso Duplictor wins. The grph G f A cn e modified to otin G o A nd G di A, oth of which require only trivil modifiction to G f A. The prity gme grph G o A is exctly the sme s G f A, except tht ll nodes will receive priority 0. This mens, tht Duplictor wins s long s he cn mimick the moves of Spoiler nd he only loses, if he comes to ded-end nd cn t move nymore. The prity gme grph G di A is just like G o A, mening every vertex hs priority 0, ut some edges re eliminted: Finlly to define G de A the gme grph hs to e modified somewht more. For ech vertex of G f A there will e t most two corresponding vertices in G de A: The extr it encodes whether or not, thus fr in the simultion gme, the Red pele ws witnessed n ccept stte without Blue hving witnessed one since then. The edges of G de A re s follows: Lst ut not lest the priority function of G de A is descried s:.. Here, priority 1 will e ssigned to only those vertices in V 1 tht signify tht n unmtched ccept hs een encountered y Red.

6 References Crsten Fritz, Thoms Wilke: Simultion Reltions for Alternting Prity Automt nd Prity Gmes. DLT 2006, LNCS 4036, pp , Springer-Verlg (2006) Koush Etessmi, Thoms Wilke, Reecc A. Schuller: Fir Simultion Reltions, Prity Gmes nd Stte Spce Reduction for Büchi Automt. ICALP 2001, LNCS 2076, pp , Springer-Verlg (2001) Crsten Fritz: Simultion-Bsed Simplifiction of omeg-automt. PhD thesis, Technische Fkultät der Christin Alrecht Universität zu Kiel (2005) ville t

### Finite Automata. Informatics 2A: Lecture 3. John Longley. 25 September School of Informatics University of Edinburgh

Lnguges nd Automt Finite Automt Informtics 2A: Lecture 3 John Longley School of Informtics University of Edinburgh jrl@inf.ed.c.uk 25 September 2015 1 / 30 Lnguges nd Automt 1 Lnguges nd Automt Wht is

### Homework 3 Solutions

CS 341: Foundtions of Computer Science II Prof. Mrvin Nkym Homework 3 Solutions 1. Give NFAs with the specified numer of sttes recognizing ech of the following lnguges. In ll cses, the lphet is Σ = {,1}.

### Regular Sets and Expressions

Regulr Sets nd Expressions Finite utomt re importnt in science, mthemtics, nd engineering. Engineers like them ecuse they re super models for circuits (And, since the dvent of VLSI systems sometimes finite

### Formal Languages and Automata Exam

Forml Lnguges nd Automt Exm Fculty of Computers & Informtion Deprtment: Computer Science Grde: Third Course code: CSC 34 Totl Mrk: 8 Dte: 23//2 Time: 3 hours Answer the following questions: ) Consider

### 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

### One Minute To Learn Programming: Finite Automata

Gret Theoreticl Ides In Computer Science Steven Rudich CS 15-251 Spring 2005 Lecture 9 Fe 8 2005 Crnegie Mellon University One Minute To Lern Progrmming: Finite Automt Let me tech you progrmming lnguge

### Polynomial Functions. Polynomial functions in one variable can be written in expanded form as ( )

Polynomil Functions Polynomil functions in one vrible cn be written in expnded form s n n 1 n 2 2 f x = x + x + x + + x + x+ n n 1 n 2 2 1 0 Exmples of polynomils in expnded form re nd 3 8 7 4 = 5 4 +

### Unit-4: Regular properties

1/26 Unit-4: Regulr properties B. Srivthsn Chenni Mthemticl Institute NPTEL-course July - November 2015 2/26 Module 2: A gentle introduction to utomt 3/26 { p 1 } { p 1,p 2 } request=1 redy request=1 busy

### Equations between labeled directed graphs

Equtions etween leled directed grphs Existence of solutions Grret-Fontelles A., Misnikov A., Ventur E. My 2013 Motivtionl prolem H 1 nd H 2 two sugroups of the free group generted y X A, F (X, A). H 1

### has the desired form. On the other hand, its product with z is 1. So the inverse x

First homework ssignment p. 5 Exercise. Verify tht the set of complex numers of the form x + y 2, where x nd y re rtionl, is sufield of the field of complex numers. Solution: Evidently, this set contins

### Appendix D: Completing the Square and the Quadratic Formula. In Appendix A, two special cases of expanding brackets were considered:

Appendi D: Completing the Squre nd the Qudrtic Formul Fctoring qudrtic epressions such s: + 6 + 8 ws one of the topics introduced in Appendi C. Fctoring qudrtic epressions is useful skill tht cn help you

### Union, Intersection and Complement. Formal Foundations Computer Theory

Union, Intersection nd Complement FAs Union, Intersection nd Complement FAs Forml Foundtions Computer Theory Ferury 21, 2013 This hndout shows (y exmples) how to construct FAs for the union, intersection

### Lecture 15 - Curve Fitting Techniques

Lecture 15 - Curve Fitting Techniques Topics curve fitting motivtion liner regression Curve fitting - motivtion For root finding, we used given function to identify where it crossed zero where does fx

### Section 5-4 Trigonometric Functions

5- Trigonometric Functions Section 5- Trigonometric Functions Definition of the Trigonometric Functions Clcultor Evlution of Trigonometric Functions Definition of the Trigonometric Functions Alternte Form

### not to be republished NCERT POLYNOMIALS CHAPTER 2 (A) Main Concepts and Results (B) Multiple Choice Questions

POLYNOMIALS (A) Min Concepts nd Results Geometricl mening of zeroes of polynomil: The zeroes of polynomil p(x) re precisely the x-coordintes of the points where the grph of y = p(x) intersects the x-xis.

### Chapter 9: Quadratic Equations

Chpter 9: Qudrtic Equtions QUADRATIC EQUATIONS DEFINITION + + c = 0,, c re constnts (generlly integers) ROOTS Synonyms: Solutions or Zeros Cn hve 0, 1, or rel roots Consider the grph of qudrtic equtions.

### Turing Machine Extensions

Red K & S 4.3.1, 4.4. Do Homework 19. Turing Mchine Extensions Turing Mchine Definitions An lterntive definition of Turing mchine: (K, Σ, Γ, δ, s, H): Γ is finite set of llowble tpe symbols. One of these

### Integration by Substitution

Integrtion by Substitution Dr. Philippe B. Lvl Kennesw Stte University August, 8 Abstrct This hndout contins mteril on very importnt integrtion method clled integrtion by substitution. Substitution is

### Reasoning to Solve Equations and Inequalities

Lesson4 Resoning to Solve Equtions nd Inequlities In erlier work in this unit, you modeled situtions with severl vriles nd equtions. For exmple, suppose you were given usiness plns for concert showing

### Regular Language Membership Constraint

Regulr Lnguge Memership Constrint Niko Pltzer Universität des Srlndes, Deutschlnd, nikopp@ps.uni-s.de, Advisor: Lutz Strßurger Astrct. This pper minly dels with the work of Gilles Pesnt on the stretch

### Pentominoes. Pentominoes. Bruce Baguley Cascade Math Systems, LLC. The pentominoes are a simple-looking set of objects through which some powerful

Pentominoes Bruce Bguley Cscde Mth Systems, LLC Astrct. Pentominoes nd their reltives the polyominoes, polycues, nd polyhypercues will e used to explore nd pply vrious importnt mthemticl concepts. In this

### PROF. BOYAN KOSTADINOV NEW YORK CITY COLLEGE OF TECHNOLOGY, CUNY

MAT 0630 INTERNET RESOURCES, REVIEW OF CONCEPTS AND COMMON MISTAKES PROF. BOYAN KOSTADINOV NEW YORK CITY COLLEGE OF TECHNOLOGY, CUNY Contents 1. ACT Compss Prctice Tests 1 2. Common Mistkes 2 3. Distributive

### Factoring Polynomials

Fctoring Polynomils Some definitions (not necessrily ll for secondry school mthemtics): A polynomil is the sum of one or more terms, in which ech term consists of product of constnt nd one or more vribles

### DFA Operations. Complement, Product, Union, Intersection, Difference, Equivalence and Minimization of DFAs

DFA Opertions Complement, Product, nion, Intersection, Difference, Equivlence nd inimiztion of DFAs Wednesdy, Octoer 7, 2009 eding: ipser pp. 45-46, toughton 3.11 3.12 C235 nguges nd Automt Deprtment of

### The Math Learning Center PO Box 12929, Salem, Oregon 97309 0929 Math Learning Center

Resource Overview Quntile Mesure: Skill or Concept: 1010Q Determine perimeter using concrete models, nonstndrd units, nd stndrd units. (QT M 146) Use models to develop formuls for finding res of tringles,

### 3 Determinization of Büchi-Automata

3 Determiniztion of Büchi-Automt Mrkus Roggenbch Bremen Institute for Sfe Systems Bremen University For Bene Introduction To determinize Büchi utomt it is necessry to switch to nother clss of ω-utomt,

### ENGR HOMEWORK-6-SOLUTIONS

ENGR -215 HOMEWORK-6-SOLUTIONS 1. Exercise 26.5 2. Exercise 26.6 3. Exercise 26.31 4. Exercise 26.32 5. Exercise 26.36 6. Exercise 26.4 7. Exercise 26.43 8. Exercise 26.54 9. Prolem 26.64 1. Prolem 26.67

### 2 DIODE CLIPPING and CLAMPING CIRCUITS

2 DIODE CLIPPING nd CLAMPING CIRCUITS 2.1 Ojectives Understnding the operting principle of diode clipping circuit Understnding the operting principle of clmping circuit Understnding the wveform chnge of

### Example 27.1 Draw a Venn diagram to show the relationship between counting numbers, whole numbers, integers, and rational numbers.

2 Rtionl Numbers Integers such s 5 were importnt when solving the eqution x+5 = 0. In similr wy, frctions re importnt for solving equtions like 2x = 1. Wht bout equtions like 2x + 1 = 0? Equtions of this

### CS 341 Homework 1 Basic Techniques

II. Homework CS 341 Homework 1 Bsic Techniques 1. Wht re these sets? Write them using rces, comms, numerls, (for infinite sets), nd only. () ({1, 3, 5} {3, 1}) {3, 5, 7} () {{3}, {3, 5}, {{5, 7}, {7, 9}}}

### EQUATIONS OF LINES AND PLANES

EQUATIONS OF LINES AND PLANES MATH 195, SECTION 59 (VIPUL NAIK) Corresponding mteril in the ook: Section 12.5. Wht students should definitely get: Prmetric eqution of line given in point-direction nd twopoint

### Rational Numbers - Grade 10 [CAPS]

OpenStx-CNX module: m848 Rtionl Numers - Grde 0 [CAPS] Free High School Science Texts Project Bsed on Rtionl Numers y Rory Adms Free High School Science Texts Project Mrk Horner Hether Willims This work

### Uniform convergence and its consequences

Uniform convergence nd its consequences The following issue is centrl in mthemtics: On some domin D, we hve sequence of functions {f n }. This mens tht we relly hve n uncountble set of ordinry sequences,

### Square Roots Teacher Notes

Henri Picciotto Squre Roots Techer Notes This unit is intended to help students develop n understnding of squre roots from visul / geometric point of view, nd lso to develop their numer sense round this

### Or more simply put, when adding or subtracting quantities, their uncertainties add.

Propgtion of Uncertint through Mthemticl Opertions Since the untit of interest in n eperiment is rrel otined mesuring tht untit directl, we must understnd how error propgtes when mthemticl opertions re

### Exponentiation: Theorems, Proofs, Problems Pre/Calculus 11, Veritas Prep.

Exponentition: Theorems, Proofs, Problems Pre/Clculus, Verits Prep. Our Exponentition Theorems Theorem A: n+m = n m Theorem B: ( n ) m = nm Theorem C: (b) n = n b n ( ) n n Theorem D: = b b n Theorem E:

### Generalized Inverses: How to Invert a Non-Invertible Matrix

Generlized Inverses: How to Invert Non-Invertible Mtrix S. Swyer September 7, 2006 rev August 6, 2008. Introduction nd Definition. Let A be generl m n mtrix. Then nturl question is when we cn solve Ax

### Solution to Problem Set 1

CSE 5: Introduction to the Theory o Computtion, Winter A. Hevi nd J. Mo Solution to Prolem Set Jnury, Solution to Prolem Set.4 ). L = {w w egin with nd end with }. q q q q, d). L = {w w h length t let

### Addition and subtraction of rational expressions

Lecture 5. Addition nd subtrction of rtionl expressions Two rtionl expressions in generl hve different denomintors, therefore if you wnt to dd or subtrct them you need to equte the denomintors first. The

### Bayesian Updating with Continuous Priors Class 13, 18.05, Spring 2014 Jeremy Orloff and Jonathan Bloom

Byesin Updting with Continuous Priors Clss 3, 8.05, Spring 04 Jeremy Orloff nd Jonthn Bloom Lerning Gols. Understnd prmeterized fmily of distriutions s representing continuous rnge of hypotheses for the

### Solutions to Section 1

Solutions to Section Exercise. Show tht nd. This follows from the fct tht mx{, } nd mx{, } Exercise. Show tht = { if 0 if < 0 Tht is, the bsolute vlue function is piecewise defined function. Grph this

### DIGITAL CIRCUITS EXAMPLES (questions and solutions) Dr. N. AYDIN

DIGITAL CIRCUITS EXAMPLES (questions nd solutions) Dr. N. AYDIN nydin@yildiz.edu.tr Emple. Assume tht the inverter in the network elow hs propgtion dely of 5 ns nd the AND gte hs propgtion dely of ns.

### 1.2 The Integers and Rational Numbers

.2. THE INTEGERS AND RATIONAL NUMBERS.2 The Integers n Rtionl Numers The elements of the set of integers: consist of three types of numers: Z {..., 5, 4, 3, 2,, 0,, 2, 3, 4, 5,...} I. The (positive) nturl

### Chapter 6 Solving equations

Chpter 6 Solving equtions Defining n eqution 6.1 Up to now we hve looked minly t epressions. An epression is n incomplete sttement nd hs no equl sign. Now we wnt to look t equtions. An eqution hs n = sign

### Quadratic Equations - 1

Alger Module A60 Qudrtic Equtions - 1 Copyright This puliction The Northern Alert Institute of Technology 00. All Rights Reserved. LAST REVISED Novemer, 008 Qudrtic Equtions - 1 Sttement of Prerequisite

### FORMAL LANGUAGES, AUTOMATA AND THEORY OF COMPUTATION EXERCISES ON REGULAR LANGUAGES

FORMAL LANGUAGES, AUTOMATA AND THEORY OF COMPUTATION EXERCISES ON REGULAR LANGUAGES Introduction This compendium contins exercises out regulr lnguges for the course Forml Lnguges, Automt nd Theory of Computtion

### Know the sum of angles at a point, on a straight line and in a triangle

2.1 ngle sums Know the sum of ngles t point, on stright line n in tringle Key wors ngle egree ngle sum n ngle is mesure of turn. ngles re usully mesure in egrees, or for short. ngles tht meet t point mke

### Answer, Key Homework 10 David McIntyre 1

Answer, Key Homework 10 Dvid McIntyre 1 This print-out should hve 22 questions, check tht it is complete. Multiple-choice questions my continue on the next column or pge: find ll choices efore mking your

### 0.1 Basic Set Theory and Interval Notation

0.1 Bsic Set Theory nd Intervl Nottion 3 0.1 Bsic Set Theory nd Intervl Nottion 0.1.1 Some Bsic Set Theory Notions Like ll good Mth ooks, we egin with definition. Definition 0.1. A set is well-defined

### Use Geometry Expressions to create a more complex locus of points. Find evidence for equivalence using Geometry Expressions.

Lerning Objectives Loci nd Conics Lesson 3: The Ellipse Level: Preclculus Time required: 120 minutes In this lesson, students will generlize their knowledge of the circle to the ellipse. The prmetric nd

### Solving Linear Equations - Formulas

1. Solving Liner Equtions - Formuls Ojective: Solve liner formuls for given vrile. Solving formuls is much like solving generl liner equtions. The only difference is we will hve severl vriles in the prolem

### FAULT TREES AND RELIABILITY BLOCK DIAGRAMS. Harry G. Kwatny. Department of Mechanical Engineering & Mechanics Drexel University

SYSTEM FAULT AND Hrry G. Kwtny Deprtment of Mechnicl Engineering & Mechnics Drexel University OUTLINE SYSTEM RBD Definition RBDs nd Fult Trees System Structure Structure Functions Pths nd Cutsets Reliility

### 1. The leves re either lbeled with sentences in ;, or with sentences of the form All X re X. 2. The interior leves hve two children drwn bove them) if

Q520 Notes on Nturl Logic Lrry Moss We hve seen exmples of wht re trditionlly clled syllogisms lredy: All men re mortl. Socrtes is mn. Socrtes is mortl. The ide gin is tht the sentences bove the line should

### Formal Language Theory

Chpter 6 Forml Lnguge Theory In this chpter, we introduce forml lnguge theory, the computtionl theories of lnguges nd grmmrs. The models re ctully inspired y forml logic, enriched with insights from the

### LiveEngage Agent Guide. Version 1.0

Agent Guide Version 1.0 Tle of Contents Contents LOGGING IN... 3 NAVIGATING LIVEENGAGE... 4 Visitor List, Connection Are, Enggement Br & Going Online... 4 ENGAGEMENT OPTIONS... 5 Tking n Enggment... 5

### Simple Electric Circuits

Simple Eletri Ciruits Gol: To uild nd oserve the opertion of simple eletri iruits nd to lern mesurement methods for eletri urrent nd voltge using mmeters nd voltmeters. L Preprtion Eletri hrges move through

### Algebra Review. How well do you remember your algebra?

Algebr Review How well do you remember your lgebr? 1 The Order of Opertions Wht do we men when we write + 4? If we multiply we get 6 nd dding 4 gives 10. But, if we dd + 4 = 7 first, then multiply by then

### CONIC SECTIONS. Chapter 11

CONIC SECTIONS Chpter 11 11.1 Overview 11.1.1 Sections of cone Let l e fied verticl line nd m e nother line intersecting it t fied point V nd inclined to it t n ngle α (Fig. 11.1). Fig. 11.1 Suppose we

### A.7.1 Trigonometric interpretation of dot product... 324. A.7.2 Geometric interpretation of dot product... 324

A P P E N D I X A Vectors CONTENTS A.1 Scling vector................................................ 321 A.2 Unit or Direction vectors...................................... 321 A.3 Vector ddition.................................................

### Binary Representation of Numbers Autar Kaw

Binry Representtion of Numbers Autr Kw After reding this chpter, you should be ble to: 1. convert bse- rel number to its binry representtion,. convert binry number to n equivlent bse- number. In everydy

### Anti-derivatives/Indefinite Integrals of Basic Functions

Anti-derivtives/Indefinite Integrls of Bsic Functions Power Rule: x n+ x n n + + C, dx = ln x + C, if n if n = In prticulr, this mens tht dx = ln x + C x nd x 0 dx = dx = dx = x + C Integrl of Constnt:

### Quadratic Equations. Math 99 N1 Chapter 8

Qudrtic Equtions Mth 99 N1 Chpter 8 1 Introduction A qudrtic eqution is n eqution where the unknown ppers rised to the second power t most. In other words, it looks for the vlues of x such tht second degree

### Plotting and Graphing

Plotting nd Grphing Much of the dt nd informtion used by engineers is presented in the form of grphs. The vlues to be plotted cn come from theoreticl or empiricl (observed) reltionships, or from mesured

### LINEAR TRANSFORMATIONS AND THEIR REPRESENTING MATRICES

LINEAR TRANSFORMATIONS AND THEIR REPRESENTING MATRICES DAVID WEBB CONTENTS Liner trnsformtions 2 The representing mtrix of liner trnsformtion 3 3 An ppliction: reflections in the plne 6 4 The lgebr of

### Fractions: Arithmetic Review

Frtions: Arithmeti Review Frtions n e interprete s rtios omprisons of two quntities. For given numer expresse in frtion nottion suh s we ll the numertor n the enomintor n it is helpful to interpret this

### Lecture 3 Basic Probability and Statistics

Lecture 3 Bsic Probbility nd Sttistics The im of this lecture is to provide n extremely speedy introduction to the probbility nd sttistics which will be needed for the rest of this lecture course. The

### Generating In-Line Monitors For Rabin Automata

Generting In-Line Monitors For Rin Automt Hugues Chot, Rphel Khoury, nd Ndi Twi Lvl University, Deprtment of Computer Science nd Softwre Engineering, Pvillon Adrien-Pouliot, 1065, venue de l Medecine Queec

### Lesson 10. Parametric Curves

Return to List of Lessons Lesson 10. Prmetric Curves (A) Prmetric Curves If curve fils the Verticl Line Test, it cn t be expressed by function. In this cse you will encounter problem if you try to find

### Well say we were dealing with a weak acid K a = 1x10, and had a formal concentration of.1m. What is the % dissociation of the acid?

Chpter 9 Buffers Problems 2, 5, 7, 8, 9, 12, 15, 17,19 A Buffer is solution tht resists chnges in ph when cids or bses re dded or when the solution is diluted. Buffers re importnt in Biochemistry becuse

### Number Systems & Working With Numbers

Presenting the Mths Lectures! Your best bet for Qunt... MATHS LECTURE # 0 Number Systems & Working With Numbers System of numbers.3 0.6 π With the help of tree digrm, numbers cn be clssified s follows

### The AVL Tree Rotations Tutorial

The AVL Tree Rottions Tutoril By John Hrgrove Version 1.0.1, Updted Mr-22-2007 Astrt I wrote this doument in n effort to over wht I onsider to e drk re of the AVL Tree onept. When presented with the tsk

### Content Objectives: After completing the activity, students will gain experience of informally proving Pythagoras Theorem

Pythgors Theorem S Topic 1 Level: Key Stge 3 Dimension: Mesures, Shpe nd Spce Module: Lerning Geometry through Deductive Approch Unit: Pythgors Theorem Student ility: Averge Content Ojectives: After completing

### GRADE 7 ADAPTED NJDOE ASSESSMENT. Assessed Standards: 7.NS.1 7.NS.2 7.NS.3. (To be administered after NPS Grade 7 Scope and Sequence Units 1&2)

ADAPTED NJDOE ASSESSMENT GRADE 7 (To e dministered fter NPS Grde 7 Scope nd Sequence Units &2) Assessed Stndrds: 7.NS. 7.NS.2 7.NS.3 The Newrk Pulic Schools - Office of Mthemtics 203 Nme Period Dte Grde

### Algorithms Chapter 4 Recurrences

Algorithms Chpter 4 Recurrences Outline The substitution method The recursion tree method The mster method Instructor: Ching Chi Lin 林清池助理教授 chingchilin@gmilcom Deprtment of Computer Science nd Engineering

### Notes for Thurs 8 Sept Calculus II Fall 2005 New York University Instructor: Tyler Neylon Scribe: Kelsey Williams

Notes for Thurs 8 Sept Clculus II Fll 00 New York University Instructor: Tyler Neylon Scribe: Kelsey Willims 8. Integrtion by Prts This section is primrily bout the formul u dv = uv v ( ) which is essentilly

### Suffix Trees CMSC 423

Suffix Trees CMSC 423 Preprocessing Strings Over the next few lectures, we ll see severl methods for preprocessing string dt into dt structures tht mke mny questions (like serching) esy to nswer: Suffix

### Homework 3 Solution Chapter 3.

Homework 3 Solution Chpter 3 2 Let Q e the group of rtionl numers under ddition nd let Q e the group of nonzero rtionl numers under multiplition In Q, list the elements in 1 2 In Q, list the elements in

### Mathematics Higher Level

Mthemtics Higher Level Higher Mthemtics Exmintion Section : The Exmintion Mthemtics Higher Level. Structure of the exmintion pper The Higher Mthemtics Exmintion is divided into two ppers s detiled below:

### Basics of Logic Design: Boolean Algebra, Logic Gates. Administrative

Bsics of Logic Design: Boolen Alger, Logic Gtes Computer Science 104 Administrtive Homework #3 Due Sundy Midterm I Mondy in clss, closed ook, closed notes Ø Will provide IA32 instruction set hndout Ø Lst

### Section A-4 Rational Expressions: Basic Operations

A- Appendi A A BASIC ALGEBRA REVIEW 7. Construction. A rectngulr open-topped bo is to be constructed out of 9- by 6-inch sheets of thin crdbord by cutting -inch squres out of ech corner nd bending the

### Chapter. Contents: A Constructing decimal numbers

Chpter 9 Deimls Contents: A Construting deiml numers B Representing deiml numers C Deiml urreny D Using numer line E Ordering deimls F Rounding deiml numers G Converting deimls to frtions H Converting

### Assuming all values are initially zero, what are the values of A and B after executing this Verilog code inside an always block? C=1; A <= C; B = C;

B-26 Appendix B The Bsics of Logic Design Check Yourself ALU n [Arthritic Logic Unit or (rre) Arithmetic Logic Unit] A rndom-numer genertor supplied s stndrd with ll computer systems Stn Kelly-Bootle,

### N Mean SD Mean SD Shelf # Shelf # Shelf #

NOV xercises smple of 0 different types of cerels ws tken from ech of three grocery store shelves (1,, nd, counting from the floor). summry of the sugr content (grms per serving) nd dietry fiber (grms

### Math 135 Circles and Completing the Square Examples

Mth 135 Circles nd Completing the Squre Exmples A perfect squre is number such tht = b 2 for some rel number b. Some exmples of perfect squres re 4 = 2 2, 16 = 4 2, 169 = 13 2. We wish to hve method for

### 10.3 Systems of Linear Equations: Determinants

758 CHAPTER 10 Systems of Equtions nd Inequlities 10.3 Systems of Liner Equtions: Determinnts OBJECTIVES 1 Evlute 2 y 2 Determinnts 2 Use Crmer s Rule to Solve System of Two Equtions Contining Two Vriles

### In this section make precise the idea of a matrix inverse and develop a method to find the inverse of a given square matrix when it exists.

Mth 52 Sec S060/S0602 Notes Mtrices IV 5 Inverse Mtrices 5 Introduction In our erlier work on mtrix multipliction, we sw the ide of the inverse of mtrix Tht is, for squre mtrix A, there my exist mtrix

### 2 If a branch is prime, no other factors

Chpter 2 Multiples, nd primes 59 Find the prime of 50 by drwing fctor tree. b Write 50 s product of its prime. 1 Find fctor pir of the given 50 number nd begin the fctor tree (50 = 5 10). 5 10 2 If brnch

### Education Spending (in billions of dollars) Use the distributive property.

0 CHAPTER Review of the Rel Number System 96. An pproximtion of federl spending on eduction in billions of dollrs from 200 through 2005 cn be obtined using the e xpression y = 9.0499x - 8,07.87, where

### Sirindhorn International Institute of Technology Thammasat University at Rangsit

Sirindhorn Interntionl Institute of Technology Thmmst University t Rngsit School of Informtion, Computer nd Communiction Technology COURSE : ECS 204 Bsic Electricl Engineering L INSTRUCTOR : Asst. Prof.

### Modular Generic Verification of LTL Properties for Aspects

Modulr Generic Verifiction of LTL Properties for Aspects Mx Goldmn Shmuel Ktz Computer Science Deprtment Technion Isrel Institute of Technology {mgoldmn, ktz}@cs.technion.c.il ABSTRACT Aspects re seprte

### SCHOOL OF ENGINEERING & BUILT ENVIRONMENT. Mathematics. Basic Algebra

SCHOOL OF ENGINEERING & BUILT ENVIRONMENT Mthemtics Bsic Alger. Opertions nd Epressions. Common Mistkes. Division of Algeric Epressions. Eponentil Functions nd Logrithms. Opertions nd their Inverses. Mnipulting

### Lines and Angles. 2. Straight line is a continuous set of points going on forever in both directions:

Lines nd Angles 1. Point shows position. A 2. Stright line is continuous set of points going on forever in oth directions: 3. Ry is line with one endpoint. The other goes on forever. G 4. Line segment

### flex Regular Expressions and Lexical Scanning Regular Expressions and flex Examples on Alphabet A = {a,b} (Standard) Regular Expressions on Alphabet A

flex Regulr Expressions nd Lexicl Scnning Using flex to Build Scnner flex genertes lexicl scnners: progrms tht discover tokens. Tokens re the smllest meningful units of progrm (or other string). flex is

### Picture Match Words Planets Energy Space Matter Galaxies Universe Star Time Particles Atom

Picture Mtch Words Plnets Energy Spce Mtter Glxies Universe Str Time Prticles Atom Mterils copyrighted by the University of Louisville. Eductors re free to use these mterils with the proper cknowledgement

### 11. Fourier series. sin mx cos nx dx = 0 for any m, n, sin 2 mx dx = π.

. Fourier series Summry of the bsic ides The following is quick summry of the introductory tretment of Fourier series in MATH. We consider function f with period π, tht is, stisfying f(x + π) = f(x) for

### NUMBER SYSTEMS CHAPTER 1. (A) Main Concepts and Results

CHAPTER NUMBER SYSTEMS Min Concepts nd Results Rtionl numbers Irrtionl numbers Locting irrtionl numbers on the number line Rel numbers nd their deciml expnsions Representing rel numbers on the number line