Complexity in Modal Team Logic

Save this PDF as:
 WORD  PNG  TXT  JPG

Size: px
Start display at page:

Download "Complexity in Modal Team Logic"

Transcription

1 ThI Theoretische Informtik Complexity in Modl Tem Logic Julin-Steffen Müller Theoretische Informtik 18. Jnur 2012 Theorietg 2012

2 Theoretische Informtik Inhlt 1 Preliminries 2 Closure properties 3 Model Checking 4 Results 5 Conclusion Preliminries Closure properties Model Checking Results Conclusion Seite 2

3 Theoretische Informtik Motivtion Modl Dependence Logic MDL descries tomic dependencies etween vriles. Originl introduced y Vänäänen for first-order logic. Studying computle cses. Modl Tem Logic MDL cnnot express tht certin dependence etween vriles does not hold. Tem semtics without dependence tom. Preliminries Closure properties Model Checking Results Conclusion Seite 3

4 Theoretische Informtik Semntic of MTL Split junction M, T = ϕ ϕ T 1 T 2 = T : M, T 1 = ϕ nd M, T 2 = ϕ Preliminries Closure properties Model Checking Results Conclusion Seite 4

5 Theoretische Informtik Semntic of MTL Split junction M, T = ϕ ϕ T 1 T 2 = T : M, T 1 = ϕ nd M, T 2 = ϕ Exmples M, {, } = Preliminries Closure properties Model Checking Results Conclusion Seite 4

6 Theoretische Informtik Semntic of MTL Clssicl disjunction M, T = ϕ ϕ M, T = ϕ or M, T = ϕ Preliminries Closure properties Model Checking Results Conclusion Seite 4

7 Theoretische Informtik Semntic of MTL Clssicl disjunction M, T = ϕ ϕ M, T = ϕ or M, T = ϕ Exmples M, {, } = Preliminries Closure properties Model Checking Results Conclusion Seite 4

8 Theoretische Informtik Semntic of MTL Clssicl disjunction M, T = ϕ ϕ M, T = ϕ or M, T = ϕ Exmples M, {, } = M, {,, } = Preliminries Closure properties Model Checking Results Conclusion Seite 4

9 Theoretische Informtik Semntic of MTL Modl exists M, T = ϕ ˆT T : M, ˆT = ϕ Preliminries Closure properties Model Checking Results Conclusion Seite 4

10 Theoretische Informtik Semntic of MTL Modl exists M, T = ϕ ˆT T : M, ˆT = ϕ Exmples M, {, } = ( ) Preliminries Closure properties Model Checking Results Conclusion Seite 4

11 Theoretische Informtik Semntic of MTL Modl next M, T = ϕ M, R[T ] = ϕ Preliminries Closure properties Model Checking Results Conclusion Seite 4

12 Theoretische Informtik Semntic of MTL Modl next M, T = ϕ M, R[T ] = ϕ Exmples M, {, } = ( ) Preliminries Closure properties Model Checking Results Conclusion Seite 4

13 Theoretische Informtik Semntic of MTL Modl next M, T = ϕ M, R[T ] = ϕ Exmples M, {, } = ( ) M, {, } = ( ) Preliminries Closure properties Model Checking Results Conclusion Seite 4

14 Theoretische Informtik Semntic of MTL Dependence tom M, T = dep(p 1,..., p n 1 ; p n ) ˆT T : M, ˆT = ϕ Preliminries Closure properties Model Checking Results Conclusion Seite 4

15 Theoretische Informtik Semntic of MTL Dependence tom M, T = dep(p 1,..., p n 1 ; p n ) ˆT T : M, ˆT = ϕ Exmples M, {, } = dep(; ) Preliminries Closure properties Model Checking Results Conclusion Seite 4

16 Theoretische Informtik Semntic of MTL Dependence tom M, T = dep(p 1,..., p n 1 ; p n ) ˆT T : M, ˆT = ϕ Exmples M, {, } = dep(; ) M, {,, } = dep(; ) Preliminries Closure properties Model Checking Results Conclusion Seite 4

17 Theoretische Informtik Semntic of MTL Clssicl negtion M, T = ϕ M, T = ϕ Preliminries Closure properties Model Checking Results Conclusion Seite 4

18 Theoretische Informtik Semntic of MTL Clssicl negtion M, T = ϕ M, T = ϕ Exmples M, { } = Preliminries Closure properties Model Checking Results Conclusion Seite 4

19 Theoretische Informtik Semntic of MTL Clssicl negtion M, T = ϕ M, T = ϕ Exmples M, { } = M, {, } = Preliminries Closure properties Model Checking Results Conclusion Seite 4

20 Theoretische Informtik Dul opertor to opertor Let ϕ e MTL formul. Then ϕ is defined y ϕ. Preliminries Closure properties Model Checking Results Conclusion Seite 5

21 Theoretische Informtik Semntic of MTL Modl forll M, T = ϕ ˆT T : M, ˆT = ϕ Preliminries Closure properties Model Checking Results Conclusion Seite 6

22 Theoretische Informtik Semntic of MTL Modl forll M, T = ϕ ˆT T : M, ˆT = ϕ Exmples M, { } = dep() Preliminries Closure properties Model Checking Results Conclusion Seite 6

23 Theoretische Informtik Semntic of MTL Modl forll M, T = ϕ ˆT T : M, ˆT = ϕ Exmples M, { } = dep() Preliminries Closure properties Model Checking Results Conclusion Seite 6

24 Theoretische Informtik Semntic of MTL Modl forll M, T = ϕ ˆT T : M, ˆT = ϕ Exmples M, { } = dep() Preliminries Closure properties Model Checking Results Conclusion Seite 6

25 Theoretische Informtik Semntic of MTL Modl forll M, T = ϕ ˆT T : M, ˆT = ϕ Exmples M, { } = dep() Preliminries Closure properties Model Checking Results Conclusion Seite 6

26 Theoretische Informtik Semntic of MTL Modl forll M, T = ϕ ˆT T : M, ˆT = ϕ Exmples M, { } = dep() M, {, } = dep(; ) Preliminries Closure properties Model Checking Results Conclusion Seite 6

27 Theoretische Informtik Semntic of MTL Modl forll M, T = ϕ ˆT T : M, ˆT = ϕ Exmples M, { } = dep() M, {, } = dep(; ) Preliminries Closure properties Model Checking Results Conclusion Seite 6

28 Theoretische Informtik Semntic of MTL Modl forll M, T = ϕ ˆT T : M, ˆT = ϕ Exmples M, { } = dep() M, {, } = dep(; ) Preliminries Closure properties Model Checking Results Conclusion Seite 6

29 Theoretische Informtik Semntic of MTL Modl forll M, T = ϕ ˆT T : M, ˆT = ϕ Exmples M, { } = dep() M, {, } = dep(; ) Preliminries Closure properties Model Checking Results Conclusion Seite 6

30 Theoretische Informtik Semntic of MTL Modl forll M, T = ϕ ˆT T : M, ˆT = ϕ Exmples M, { } = dep() M, {, } = dep(; ) Preliminries Closure properties Model Checking Results Conclusion Seite 6

31 Theoretische Informtik Closure properties Downwrds closure M, T = ϕ T T : M, T = ϕ Union closure M, T = ϕ nd M, T = ϕ M, T T = ϕ Fltness M, T = ϕ w T : M, w = ϕ Fltness follows from downwrds nd union closure! Preliminries Closure properties Model Checking Results Conclusion Seite 7

32 Theoretische Informtik Closure properties Downwrds closure ML MDL MTL M, T = ϕ T T : M, T = ϕ Union closure M, T = ϕ nd M, T = ϕ M, T T = ϕ Fltness M, T = ϕ w T : M, w = ϕ Fltness follows from downwrds nd union closure! Preliminries Closure properties Model Checking Results Conclusion Seite 7

33 Theoretische Informtik Closure properties Downwrds closure ML MDL MTL M, T = ϕ T T : M, T = ϕ Union closure ML MDL MTL M, T = ϕ nd M, T = ϕ M, T T = ϕ Fltness M, T = ϕ w T : M, w = ϕ Fltness follows from downwrds nd union closure! Preliminries Closure properties Model Checking Results Conclusion Seite 7

34 Theoretische Informtik Closure properties Downwrds closure ML MDL MTL M, T = ϕ T T : M, T = ϕ Union closure ML MDL MTL M, T = ϕ nd M, T = ϕ M, T T = ϕ Fltness ML MDL MTL M, T = ϕ w T : M, w = ϕ Fltness follows from downwrds nd union closure! Preliminries Closure properties Model Checking Results Conclusion Seite 7

35 Theoretische Informtik ϕ ϕ Theorem Let ϕ e downwrds closed MTL formul. Then ϕ is equivlent to ϕ. Preliminries Closure properties Model Checking Results Conclusion Seite 8

36 Theoretische Informtik Model Checking Prolem MTL-MC Instnce: MTL formul ϕ, Kripke Modell M, MTL tem T Question: Is ϕ vlid under M nd T (M, T = ϕ)? MTL-SAT Instnce: MTL formul ϕ Question: Is there Kripke Model M nd tem T which stisfies ϕ? Preliminries Closure properties Model Checking Results Conclusion Seite 9

37 Theoretische Informtik Known Results for MDL Modl dependence logic (MDL) is defined nlogous to modl tem logic, ut without the clssicl negtion. Complexity of Model Checking It ws shown y Eing nd Lohmnn in 2011 tht the model checking prolem for MDL is NP-complete. Complexity of Stisfyility It ws shown y Lohmnn nd Vollmer in 2010 tht the stisfiility prolem for MDL is NEXPTIME-complete. How expressive is MTL in comprsion to MDL? Preliminries Closure properties Model Checking Results Conclusion Seite 10

38 Theoretische Informtik Result overview k dep Complexity PSPACE-complete PSPACE-complete k 0 + Σ p k+1 -complete k 0 Σ p k -complete P NP[1] -complete + + P-complete NC 1 -complete Telle: Complexity results for model checking in MTL Preliminries Closure properties Model Checking Results Conclusion Seite 11

39 Theoretische Informtik MTL-MC is in PSPACE Non determinism in MDL Let M e Kripke Model nd T tem over M. 1 M, T = ϕ ϕ T 1, T 2 with T = T 1 T 2 : T 1 = ϕ nd T 2 = ϕ 2 M, T = ϕ ˆT T : M ˆT = ϕ 3 M, T = ϕ M, T = ϕ In worst cse ech su formul uses the non determinism to serch through ll worlds. This is polynomil ounded in spce. Preliminries Closure properties Model Checking Results Conclusion Seite 12

40 Theoretische Informtik MTL-MC is PSPACE-hrd Theorem Let ϕ = x 1 x 2... x m n i=1 C i. Then ϕ 3QBF (M, T, δ 1 ) MTL-MC. Kripke Model M p 1 1 p 1 1 p 1 1 p 1 n 0... n w n n d d n 0... d n n 0... n w n n p 0 1 p 0 1 p 0 1 p 0 n Preliminries Closure properties Model Checking Results Conclusion Seite 13

41 Theoretische Informtik MTL-MC is PSPACE-hrd Theorem Let ϕ = x 1 x 2... x m n i=1 C i. Then ϕ 3QBF (M, T, δ 1 ) MTL-MC. Kripke Model M, strting tem T p 1 1 p 1 1 p 1 1 p 1 n 0... n w n n d 1... d 0 0 n... d n n 0... n w n n p 0 1 p 0 1 p 0 1 p 0 n Preliminries Closure properties Model Checking Results Conclusion Seite 13

42 Theoretische Informtik MTL-MC is PSPACE-hrd Existentil prt (i is odd) δ i = ((p 1 i p 0 i ) δ i+1) Universl prt (i is even) δ i = ((p 1 i p 0 i ) δ i+1) Evlution (i = n + 1) δ i = m i=1 ( l i1 l i2 l i3 ) Preliminries Closure properties Model Checking Results Conclusion Seite 14

43 Theoretische Informtik Restricted clssicl negtion Wht hppens if the nesting of clssicl negtion is restricted? Equivilnt with restricting the lterntion of existentil nd universl quntifictions. 3QBF k. MTL-MC(,,, ) is Σ p k -complete. MTL-MC(,,,, dep) is Σ p k+1 -complete. Preliminries Closure properties Model Checking Results Conclusion Seite 15

44 Theoretische Informtik MTL-MC (, dep, ) is in P NP[1] Ech MTL formul over {, dep, } is of the form ϕ = ϕ or ϕ = ϕ, where: ϕ = i 1 i 2... i k λ λ {dep} VAR ϕ cn e solved with the NP-complete prolem MDL-MC. Orcle Answer is negted if ϕ = ϕ. Preliminries Closure properties Model Checking Results Conclusion Seite 16

45 Theoretische Informtik MTL-MC(, dep, ) is P NP[1] hrd A generl P NP[1] mchine cn e reduced to: input x f SAT 1 0 cc rej f SAT Preliminries Closure properties Model Checking Results Conclusion Seite 17

46 Theoretische Informtik MTL-MC(, dep, ) is P NP[1] hrd A generl P NP[1] mchine cn e reduced to: input x f SAT 1 0 cc rej f SAT input x f SAT 1 0 rej cc f SAT Preliminries Closure properties Model Checking Results Conclusion Seite 17

47 Theoretische Informtik MTL-MC(, dep, ) is P NP[1] hrd A generl P NP[1] mchine cn e reduced to: input x f SAT 1 0 cc rej f SAT input x f SAT 1 0 rej cc f SAT input x f SAT cc 1 cc 0 Accept lwys Preliminries Closure properties Model Checking Results Conclusion Seite 17

48 Theoretische Informtik MTL-MC(, dep, ) is P NP[1] hrd A generl P NP[1] mchine cn e reduced to: input x input x input x input x f SAT 1 0 cc rej f SAT 1 0 rej cc f SAT cc 1 cc 0 f SAT 1 0 rej rej f SAT f SAT Accept lwys Reject lwys Preliminries Closure properties Model Checking Results Conclusion Seite 17

49 Theoretische Informtik MTL-MC(, dep, ) is P NP[1] hrd A generl P NP[1] mchine cn e reduced to: input x input x input x input x f SAT 1 0 cc rej f SAT 1 0 rej cc f SAT cc 1 cc 0 f SAT 1 0 rej rej f SAT f SAT Accept lwys Reject lwys Since MDL-MC(, dep) is NP-complete, MTL-MC(, dep) cn simulte the SAT orcle questions. Preliminries Closure properties Model Checking Results Conclusion Seite 17

50 Theoretische Informtik Conclusion Summry Filure of downwrds closure is not the reson for the complexity lep. Restricting the clssicl negtion is equl to restrict possile quntor lterntions. Open Questions Complexity of MTL-MC(, ). Mye PSPACE-complete. Complexity of MTL stisfiility prolem. Definition nd clssifiction of dependence temporl logic. Preliminries Closure properties Model Checking Results Conclusion Seite 18

Software Engineering using Formal Methods

Software Engineering using Formal Methods Softwre Engineering using Forml Methods Propositionl nd (Liner) Temporl Logic Wolfgng Ahrendt 13th Septemer 2016 SEFM: Liner Temporl Logic /GU 160913 1 / 60 Recpitultion: FormlistionFormlistion: Syntx,

More information

Reasoning and programming. Lecture 5: Invariants and Logic. Boolean expressions. Reasoning. Examples

Reasoning and programming. Lecture 5: Invariants and Logic. Boolean expressions. Reasoning. Examples Chir of Softwre Engineering Resoning nd progrmming Einführung in die Progrmmierung Introduction to Progrmming Prof. Dr. Bertrnd Meyer Octoer 2006 Ferury 2007 Lecture 5: Invrints nd Logic Logic is the sis

More information

Deciding Hyperproperties

Deciding Hyperproperties ne.jpeg Deciding Hyperproperties Bernd Finkeiner nd Christopher Hhn Rective Systems Group Srlnd University, Germny Highlights of Logic, Gmes nd Automt Brussels, 06.-09. Septemer 2016 0 Informti Lekge Hertleed

More information

Lecture 9: LTL and Büchi Automata

Lecture 9: LTL and Büchi Automata Lecture 9: LTL nd Büchi Automt 1 LTL Property Ptterns Quite often the requirements of system follow some simple ptterns. Sometimes we wnt to specify tht property should only hold in certin context, clled

More information

Section 6.1 Definite Integral

Section 6.1 Definite Integral Section 6.1 Definite Integrl Suppose we wnt to find the re of region tht is not so nicely shped. For exmple, consider the function shown elow. The re elow the curve nd ove the x xis cnnot e determined

More information

Improper Integrals. The First Fundamental Theorem of Calculus, as we ve discussed in class, goes as follows:

Improper Integrals. The First Fundamental Theorem of Calculus, as we ve discussed in class, goes as follows: Improper Integrls The First Fundmentl Theorem of Clculus, s we ve discussed in clss, goes s follows: If f is continuous on the intervl [, ] nd F is function for which F t = ft, then ftdt = F F. An integrl

More information

Homework 3 Solutions

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}.

More information

Grammar. Languages. Content 5/10/16. Automata and Languages. Regular Languages. Regular Languages

Grammar. Languages. Content 5/10/16. Automata and Languages. Regular Languages. Regular Languages 5//6 Grmmr Automt nd Lnguges Regulr Grmmr Context-free Grmmr Context-sensitive Grmmr Prof. Mohmed Hmd Softwre Engineering L. The University of Aizu Jpn Regulr Lnguges Context Free Lnguges Context Sensitive

More information

Handout: Natural deduction for first order logic

Handout: Natural deduction for first order logic MATH 457 Introduction to Mthemticl Logic Spring 2016 Dr Json Rute Hndout: Nturl deduction for first order logic We will extend our nturl deduction rules for sententil logic to first order logic These notes

More information

Boolean Algebra. Boolean Algebra

Boolean Algebra. Boolean Algebra Boolen Alger Boolen Alger A Boolen lger is set B of vlues together with: - two inry opertions, commonly denoted y + nd, - unry opertion, usully denoted y ˉ or ~ or, - two elements usully clled zero nd

More information

State Minimization for DFAs

State Minimization for DFAs Stte Minimiztion for DFAs Red K & S 2.7 Do Homework 10. Consider: Stte Minimiztion 4 5 Is this miniml mchine? Step (1): Get rid of unrechle sttes. Stte Minimiztion 6, Stte is unrechle. Step (2): Get rid

More information

STRUCTURE OF CONCURRENCY Ryszard Janicki. Department of Computing and Software McMaster University Hamilton, ON, L8S 4K1 Canada

STRUCTURE OF CONCURRENCY Ryszard Janicki. Department of Computing and Software McMaster University Hamilton, ON, L8S 4K1 Canada STRUCTURE OF CONCURRENCY Ryszrd Jnicki Deprtment of Computing nd Softwre McMster University Hmilton, ON, L8S 4K1 Cnd jnicki@mcmster.c 1 Introduction Wht is concurrency? How it cn e modelled? Wht re the

More information

set is not closed under matrix [ multiplication, ] and does not form a group.

set is not closed under matrix [ multiplication, ] and does not form a group. Prolem 2.3: Which of the following collections of 2 2 mtrices with rel entries form groups under [ mtrix ] multipliction? i) Those of the form for which c d 2 Answer: The set of such mtrices is not closed

More information

CS 267: Automated Verification. Lecture 8: Automata Theoretic Model Checking. Instructor: Tevfik Bultan

CS 267: Automated Verification. Lecture 8: Automata Theoretic Model Checking. Instructor: Tevfik Bultan CS 267: Automted Verifiction Lecture 8: Automt Theoretic Model Checking Instructor: Tevfik Bultn LTL Properties Büchi utomt [Vrdi nd Wolper LICS 86] Büchi utomt: Finite stte utomt tht ccept infinite strings

More information

Semantic Reachability. Richard Mayr. Institut fur Informatik. Technische Universitat Munchen. Arcisstr. 21, D Munchen, Germany E. N. T. C. S.

Semantic Reachability. Richard Mayr. Institut fur Informatik. Technische Universitat Munchen. Arcisstr. 21, D Munchen, Germany E. N. T. C. S. URL: http://www.elsevier.nl/locte/entcs/volume6.html?? pges Semntic Rechbility Richrd Myr Institut fur Informtik Technische Universitt Munchen Arcisstr. 21, D-80290 Munchen, Germny e-mil: myrri@informtik.tu-muenchen.de

More information

Section: Other Models of Turing Machines. Definition: Two automata are equivalent if they accept the same language.

Section: Other Models of Turing Machines. Definition: Two automata are equivalent if they accept the same language. Section: Other Models of Turing Mchines Definition: Two utomt re equivlent if they ccept the sme lnguge. Turing Mchines with Sty Option Modify δ, Theorem Clss of stndrd TM s is equivlent to clss of TM

More information

Semantic reachability for simple process algebras. Richard Mayr. Abstract

Semantic reachability for simple process algebras. Richard Mayr. Abstract Semntic rechbility for simple process lgebrs Richrd Myr Abstrct This pper is n pproch to combine the rechbility problem with semntic notions like bisimultion equivlence. It dels with questions of the following

More information

COMPOSITIONALITY AND REACHABILITY WITH CONDITIONS ON PATH LENGTHS

COMPOSITIONALITY AND REACHABILITY WITH CONDITIONS ON PATH LENGTHS compositionlity Interntionl Journl of Foundtions of Computer Science c World Scientific Pulishing Compny COMPOSITIONALITY AND REACHABILITY WITH CONDITIONS ON PATH LENGTHS INGO FELSCHER Lehrstuhl Informtik

More information

CS 311 Homework 3 due 16:30, Thursday, 14 th October 2010

CS 311 Homework 3 due 16:30, Thursday, 14 th October 2010 CS 311 Homework 3 due 16:30, Thursdy, 14 th Octoer 2010 Homework must e sumitted on pper, in clss. Question 1. [15 pts.; 5 pts. ech] Drw stte digrms for NFAs recognizing the following lnguges:. L = {w

More information

Fachgebiet Rechnersysteme1. 1. Boolean Algebra. 1. Boolean Algebra. Verification Technology. Content. 1.1 Boolean algebra basics (recap)

Fachgebiet Rechnersysteme1. 1. Boolean Algebra. 1. Boolean Algebra. Verification Technology. Content. 1.1 Boolean algebra basics (recap) . Boolen Alger Fchgeiet Rechnersysteme. Boolen Alger Veriiction Technology Content. Boolen lger sics (recp).2 Resoning out Boolen expressions . Boolen Alger 2 The prolem o logic veriiction: Show tht two

More information

Lecture 2 : Propositions DRAFT

Lecture 2 : Propositions DRAFT CS/Mth 240: Introduction to Discrete Mthemtics 1/20/2010 Lecture 2 : Propositions Instructor: Dieter vn Melkeeek Scrie: Dlior Zelený DRAFT Lst time we nlyzed vrious mze solving lgorithms in order to illustrte

More information

Homework 4. 0 ε 0. (00) ε 0 ε 0 (00) (11) CS 341: Foundations of Computer Science II Prof. Marvin Nakayama

Homework 4. 0 ε 0. (00) ε 0 ε 0 (00) (11) CS 341: Foundations of Computer Science II Prof. Marvin Nakayama CS 341: Foundtions of Computer Science II Prof. Mrvin Nkym Homework 4 1. UsetheproceduredescriedinLemm1.55toconverttheregulrexpression(((00) (11)) 01) into n NFA. Answer: 0 0 1 1 00 0 0 11 1 1 01 0 1 (00)

More information

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

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

More information

Learning Goals. Relational Query Languages. Formal Relational Query Languages. Formal Query Languages: Relational Algebra and Relational Calculus

Learning Goals. Relational Query Languages. Formal Relational Query Languages. Formal Query Languages: Relational Algebra and Relational Calculus Forml Query Lnguges: Reltionl Alger nd Reltionl Clculus Chpter 4 Lerning Gols Given dtse ( set of tles ) you will e le to express dtse query in Reltionl Alger (RA), involving the sic opertors (selection,

More information

Linear Systems with Constant Coefficients

Linear Systems with Constant Coefficients Liner Systems with Constnt Coefficients 4-3-05 Here is system of n differentil equtions in n unknowns: x x + + n x n, x x + + n x n, x n n x + + nn x n This is constnt coefficient liner homogeneous system

More information

20 MATHEMATICS POLYNOMIALS

20 MATHEMATICS POLYNOMIALS 0 MATHEMATICS POLYNOMIALS.1 Introduction In Clss IX, you hve studied polynomils in one vrible nd their degrees. Recll tht if p(x) is polynomil in x, the highest power of x in p(x) is clled the degree of

More information

Chapter 2 Finite Automata

Chapter 2 Finite Automata Chpter 2 Finite Automt 28 2.1 Introduction Finite utomt: first model of the notion of effective procedure. (They lso hve mny other pplictions). The concept of finite utomton cn e derived y exmining wht

More information

Formal languages, automata, and theory of computation

Formal languages, automata, and theory of computation Mälrdlen University TEN1 DVA337 2015 School of Innovtion, Design nd Engineering Forml lnguges, utomt, nd theory of computtion Thursdy, Novemer 5, 14:10-18:30 Techer: Dniel Hedin, phone 021-107052 The exm

More information

Signal Flow Graphs. Consider a complex 3-port microwave network, constructed of 5 simpler microwave devices:

Signal Flow Graphs. Consider a complex 3-port microwave network, constructed of 5 simpler microwave devices: 3/3/009 ignl Flow Grphs / ignl Flow Grphs Consider comple 3-port microwve network, constructed of 5 simpler microwve devices: 3 4 5 where n is the scttering mtri of ech device, nd is the overll scttering

More information

Section 4: Integration ECO4112F 2011

Section 4: Integration ECO4112F 2011 Reding: Ching Chpter Section : Integrtion ECOF Note: These notes do not fully cover the mteril in Ching, ut re ment to supplement your reding in Ching. Thus fr the optimistion you hve covered hs een sttic

More information

Regular Expressions (RE) Regular Expressions (RE) Regular Expressions (RE) Regular Expressions (RE) Kleene-*

Regular Expressions (RE) Regular Expressions (RE) Regular Expressions (RE) Regular Expressions (RE) Kleene-* Regulr Expressions (RE) Regulr Expressions (RE) Empty set F A RE denotes the empty set Opertion Nottion Lnguge UNIX Empty string A RE denotes the set {} Alterntion R +r L(r ) L(r ) r r Symol Alterntion

More information

Designing Information Devices and Systems I Fall 2016 Babak Ayazifar, Vladimir Stojanovic Homework 6. This homework is due October 11, 2016, at Noon.

Designing Information Devices and Systems I Fall 2016 Babak Ayazifar, Vladimir Stojanovic Homework 6. This homework is due October 11, 2016, at Noon. EECS 16A Designing Informtion Devices nd Systems I Fll 2016 Bk Ayzifr, Vldimir Stojnovic Homework 6 This homework is due Octoer 11, 2016, t Noon. 1. Homework process nd study group Who else did you work

More information

CS 310 (sec 20) - Winter Final Exam (solutions) SOLUTIONS

CS 310 (sec 20) - Winter Final Exam (solutions) SOLUTIONS CS 310 (sec 20) - Winter 2003 - Finl Exm (solutions) SOLUTIONS 1. (Logic) Use truth tles to prove the following logicl equivlences: () p q (p p) (q q) () p q (p q) (p q) () p q p q p p q q (q q) (p p)

More information

u(t)dt + i a f(t)dt f(t) dt b f(t) dt (2) With this preliminary step in place, we are ready to define integration on a general curve in C.

u(t)dt + i a f(t)dt f(t) dt b f(t) dt (2) With this preliminary step in place, we are ready to define integration on a general curve in C. Lecture 4 Complex Integrtion MATH-GA 2451.001 Complex Vriles 1 Construction 1.1 Integrting complex function over curve in C A nturl wy to construct the integrl of complex function over curve in the complex

More information

12.1 Nondeterminism Nondeterministic Finite Automata. a a b ε. CS125 Lecture 12 Fall 2016

12.1 Nondeterminism Nondeterministic Finite Automata. a a b ε. CS125 Lecture 12 Fall 2016 CS125 Lecture 12 Fll 2016 12.1 Nondeterminism The ide of nondeterministic computtions is to llow our lgorithms to mke guesses, nd only require tht they ccept when the guesses re correct. For exmple, simple

More information

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

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

More information

The Dirichlet Problem in a Two Dimensional Rectangle. Section 13.5

The Dirichlet Problem in a Two Dimensional Rectangle. Section 13.5 The Dirichlet Prolem in Two Dimensionl Rectngle Section 13.5 1 Dirichlet Prolem in Rectngle In these notes we will pply the method of seprtion of vriles to otin solutions to elliptic prolems in rectngle

More information

Introduction to Electrical & Electronic Engineering ENGG1203

Introduction to Electrical & Electronic Engineering ENGG1203 Introduction to Electricl & Electronic Engineering ENGG23 2 nd Semester, 27-8 Dr. Hden Kwok-H So Deprtment of Electricl nd Electronic Engineering Astrction DIGITAL LOGIC 2 Digitl Astrction n Astrct ll

More information

MATH 573 FINAL EXAM. May 30, 2007

MATH 573 FINAL EXAM. May 30, 2007 MATH 573 FINAL EXAM My 30, 007 NAME: Solutions 1. This exm is due Wednesdy, June 6 efore the 1:30 pm. After 1:30 pm I will NOT ccept the exm.. This exm hs 1 pges including this cover. There re 10 prolems.

More information

arxiv: v1 [cs.cc] 26 Mar 2013

arxiv: v1 [cs.cc] 26 Mar 2013 Model Checking for Modal Depence Logic: An Approach Through Post s Lattice Julian-Steffen Müller and Heribert Vollmer arxiv:1303.6424v1 [cs.cc] 26 Mar 2013 Institut für Theoretische Informatik Leibniz

More information

Farey Fractions. Rickard Fernström. U.U.D.M. Project Report 2017:24. Department of Mathematics Uppsala University

Farey Fractions. Rickard Fernström. U.U.D.M. Project Report 2017:24. Department of Mathematics Uppsala University U.U.D.M. Project Report 07:4 Frey Frctions Rickrd Fernström Exmensrete i mtemtik, 5 hp Hledre: Andres Strömergsson Exmintor: Jörgen Östensson Juni 07 Deprtment of Mthemtics Uppsl University Frey Frctions

More information

dx dt dy = G(t, x, y), dt where the functions are defined on I Ω, and are locally Lipschitz w.r.t. variable (x, y) Ω.

dx dt dy = G(t, x, y), dt where the functions are defined on I Ω, and are locally Lipschitz w.r.t. variable (x, y) Ω. Chpter 8 Stility theory We discuss properties of solutions of first order two dimensionl system, nd stility theory for specil clss of liner systems. We denote the independent vrile y t in plce of x, nd

More information

New Expansion and Infinite Series

New Expansion and Infinite Series Interntionl Mthemticl Forum, Vol. 9, 204, no. 22, 06-073 HIKARI Ltd, www.m-hikri.com http://dx.doi.org/0.2988/imf.204.4502 New Expnsion nd Infinite Series Diyun Zhng College of Computer Nnjing University

More information

Formal Methods in Software Engineering

Formal Methods in Software Engineering Forml Methods in Softwre Engineering Lecture 09 orgniztionl issues Prof. Dr. Joel Greenyer Decemer 9, 2014 Written Exm The written exm will tke plce on Mrch 4 th, 2015 The exm will tke 60 minutes nd strt

More information

EE273 Lecture 15 Asynchronous Design November 16, Today s Assignment

EE273 Lecture 15 Asynchronous Design November 16, Today s Assignment EE273 Lecture 15 Asynchronous Design Novemer 16, 199 Willim J. Dlly Computer Systems Lortory Stnford University illd@csl.stnford.edu 1 Tody s Assignment Term Project see project updte hndout on we checkpoint

More information

STRAND J: TRANSFORMATIONS, VECTORS and MATRICES

STRAND J: TRANSFORMATIONS, VECTORS and MATRICES Mthemtics SKE: STRN J STRN J: TRNSFORMTIONS, VETORS nd MTRIES J3 Vectors Text ontents Section J3.1 Vectors nd Sclrs * J3. Vectors nd Geometry Mthemtics SKE: STRN J J3 Vectors J3.1 Vectors nd Sclrs Vectors

More information

ENGI 3424 Engineering Mathematics Five Tutorial Examples of Partial Fractions

ENGI 3424 Engineering Mathematics Five Tutorial Examples of Partial Fractions ENGI 44 Engineering Mthemtics Five Tutoril Exmples o Prtil Frctions 1. Express x in prtil rctions: x 4 x 4 x 4 b x x x x Both denomintors re liner non-repeted ctors. The cover-up rule my be used: 4 4 4

More information

Sturm-Liouville Theory

Sturm-Liouville Theory LECTURE 1 Sturm-Liouville Theory In the two preceing lectures I emonstrte the utility of Fourier series in solving PDE/BVPs. As we ll now see, Fourier series re just the tip of the iceerg of the theory

More information

x = a To determine the volume of the solid, we use a definite integral to sum the volumes of the slices as we let!x " 0 :

x = a To determine the volume of the solid, we use a definite integral to sum the volumes of the slices as we let!x  0 : Clculus II MAT 146 Integrtion Applictions: Volumes of 3D Solids Our gol is to determine volumes of vrious shpes. Some of the shpes re the result of rotting curve out n xis nd other shpes re simply given

More information

Classification: Rules. Prof. Pier Luca Lanzi Laurea in Ingegneria Informatica Politecnico di Milano Polo regionale di Como

Classification: Rules. Prof. Pier Luca Lanzi Laurea in Ingegneria Informatica Politecnico di Milano Polo regionale di Como Metodologie per Sistemi Intelligenti Clssifiction: Prof. Pier Luc Lnzi Lure in Ingegneri Informtic Politecnico di Milno Polo regionle di Como Rules Lecture outline Why rules? Wht re clssifiction rules?

More information

2. VECTORS AND MATRICES IN 3 DIMENSIONS

2. VECTORS AND MATRICES IN 3 DIMENSIONS 2 VECTORS AND MATRICES IN 3 DIMENSIONS 21 Extending the Theory of 2-dimensionl Vectors x A point in 3-dimensionl spce cn e represented y column vector of the form y z z-xis y-xis z x y x-xis Most of the

More information

Types of Finite Automata. CMSC 330: Organization of Programming Languages. Comparing DFAs and NFAs. NFA for (a b)*abb.

Types of Finite Automata. CMSC 330: Organization of Programming Languages. Comparing DFAs and NFAs. NFA for (a b)*abb. CMSC 330: Orgniztion of Progrmming Lnguges Finite Automt 2 Types of Finite Automt Deterministic Finite Automt () Exctly one sequence of steps for ech string All exmples so fr Nondeterministic Finite Automt

More information

Chapter Five - Eigenvalues, Eigenfunctions, and All That

Chapter Five - Eigenvalues, Eigenfunctions, and All That Chpter Five - Eigenvlues, Eigenfunctions, n All Tht The prtil ifferentil eqution methos escrie in the previous chpter is specil cse of more generl setting in which we hve n eqution of the form L 1 xux,tl

More information

Types of Finite Automata. CMSC 330: Organization of Programming Languages. Comparing DFAs and NFAs. Comparing DFAs and NFAs (cont.) Finite Automata 2

Types of Finite Automata. CMSC 330: Organization of Programming Languages. Comparing DFAs and NFAs. Comparing DFAs and NFAs (cont.) Finite Automata 2 CMSC 330: Orgniztion of Progrmming Lnguges Finite Automt 2 Types of Finite Automt Deterministic Finite Automt () Exctly one sequence of steps for ech string All exmples so fr Nondeterministic Finite Automt

More information

Continuous Random Variables Class 5, Jeremy Orloff and Jonathan Bloom

Continuous Random Variables Class 5, Jeremy Orloff and Jonathan Bloom Lerning Gols Continuous Rndom Vriles Clss 5, 8.05 Jeremy Orloff nd Jonthn Bloom. Know the definition of continuous rndom vrile. 2. Know the definition of the proility density function (pdf) nd cumultive

More information

2 b. , a. area is S= 2π xds. Again, understand where these formulas came from (pages ).

2 b. , a. area is S= 2π xds. Again, understand where these formulas came from (pages ). AP Clculus BC Review Chpter 8 Prt nd Chpter 9 Things to Know nd Be Ale to Do Know everything from the first prt of Chpter 8 Given n integrnd figure out how to ntidifferentite it using ny of the following

More information

1.3 Regular Expressions

1.3 Regular Expressions 56 1.3 Regulr xpressions These hve n importnt role in describing ptterns in serching for strings in mny pplictions (e.g. wk, grep, Perl,...) All regulr expressions of lphbet re 1.Ønd re regulr expressions,

More information

Automata and Languages

Automata and Languages Automt nd Lnguges Prof. Mohmed Hmd Softwre Engineering Lb. The University of Aizu Jpn Grmmr Regulr Grmmr Context-free Grmmr Context-sensitive Grmmr Regulr Lnguges Context Free Lnguges Context Sensitive

More information

Chapter 3 MATRIX. In this chapter: 3.1 MATRIX NOTATION AND TERMINOLOGY

Chapter 3 MATRIX. In this chapter: 3.1 MATRIX NOTATION AND TERMINOLOGY Chpter 3 MTRIX In this chpter: Definition nd terms Specil Mtrices Mtrix Opertion: Trnspose, Equlity, Sum, Difference, Sclr Multipliction, Mtrix Multipliction, Determinnt, Inverse ppliction of Mtrix in

More information

#A29 INTEGERS 17 (2017) EQUALITY OF DEDEKIND SUMS MODULO 24Z

#A29 INTEGERS 17 (2017) EQUALITY OF DEDEKIND SUMS MODULO 24Z #A29 INTEGERS 17 (2017) EQUALITY OF DEDEKIND SUMS MODULO 24Z Kurt Girstmir Institut für Mthemtik, Universität Innsruck, Innsruck, Austri kurt.girstmir@uik.c.t Received: 10/4/16, Accepted: 7/3/17, Pulished:

More information

Chapter 2. Random Variables and Probability Distributions

Chapter 2. Random Variables and Probability Distributions Rndom Vriles nd Proilit Distriutions- 6 Chpter. Rndom Vriles nd Proilit Distriutions.. Introduction In the previous chpter, we introduced common topics of proilit. In this chpter, we trnslte those concepts

More information

Exam 2 Solutions ECE 221 Electric Circuits

Exam 2 Solutions ECE 221 Electric Circuits Nme: PSU Student ID Numer: Exm 2 Solutions ECE 221 Electric Circuits Novemer 12, 2008 Dr. Jmes McNmes Keep your exm flt during the entire exm If you hve to leve the exm temporrily, close the exm nd leve

More information

MA123, Chapter 10: Formulas for integrals: integrals, antiderivatives, and the Fundamental Theorem of Calculus (pp.

MA123, Chapter 10: Formulas for integrals: integrals, antiderivatives, and the Fundamental Theorem of Calculus (pp. MA123, Chpter 1: Formuls for integrls: integrls, ntiderivtives, nd the Fundmentl Theorem of Clculus (pp. 27-233, Gootmn) Chpter Gols: Assignments: Understnd the sttement of the Fundmentl Theorem of Clculus.

More information

Design and Analysis of Distributed Interacting Systems

Design and Analysis of Distributed Interacting Systems Design nd Anlysis of Distriuted Intercting Systems Lecture 6 LTL Model Checking Prof. Dr. Joel Greenyer My 16, 2013 Some Book References (1) C. Bier, J.-P. Ktoen: Principles of Model Checking. The MIT

More information

Automata Theory 101. Introduction. Outline. Introduction Finite Automata Regular Expressions ω-automata. Ralf Huuck.

Automata Theory 101. Introduction. Outline. Introduction Finite Automata Regular Expressions ω-automata. Ralf Huuck. Outline Automt Theory 101 Rlf Huuck Introduction Finite Automt Regulr Expressions ω-automt Session 1 2006 Rlf Huuck 1 Session 1 2006 Rlf Huuck 2 Acknowledgement Some slides re sed on Wolfgng Thoms excellent

More information

Analytically, vectors will be represented by lowercase bold-face Latin letters, e.g. a, r, q.

Analytically, vectors will be represented by lowercase bold-face Latin letters, e.g. a, r, q. 1.1 Vector Alger 1.1.1 Sclrs A physicl quntity which is completely descried y single rel numer is clled sclr. Physiclly, it is something which hs mgnitude, nd is completely descried y this mgnitude. Exmples

More information

Interpreting Integrals and the Fundamental Theorem

Interpreting Integrals and the Fundamental Theorem Interpreting Integrls nd the Fundmentl Theorem Tody, we go further in interpreting the mening of the definite integrl. Using Units to Aid Interprettion We lredy know tht if f(t) is the rte of chnge of

More information

We know that if f is a continuous nonnegative function on the interval [a, b], then b

We know that if f is a continuous nonnegative function on the interval [a, b], then b 1 Ares Between Curves c 22 Donld Kreider nd Dwight Lhr We know tht if f is continuous nonnegtive function on the intervl [, b], then f(x) dx is the re under the grph of f nd bove the intervl. We re going

More information

3.1 Review of Sine, Cosine and Tangent for Right Angles

3.1 Review of Sine, Cosine and Tangent for Right Angles Foundtions of Mth 11 Section 3.1 Review of Sine, osine nd Tngent for Right Tringles 125 3.1 Review of Sine, osine nd Tngent for Right ngles The word trigonometry is derived from the Greek words trigon,

More information

Finite Automata Theory and Formal Languages TMV027/DIT321 LP4 2018

Finite Automata Theory and Formal Languages TMV027/DIT321 LP4 2018 Finite Automt Theory nd Forml Lnguges TMV027/DIT321 LP4 2018 Lecture 10 An Bove April 23rd 2018 Recp: Regulr Lnguges We cn convert between FA nd RE; Hence both FA nd RE ccept/generte regulr lnguges; More

More information

Solutions Problem Set 2. Problem (a) Let M denote the DFA constructed by swapping the accept and non-accepting state in M.

Solutions Problem Set 2. Problem (a) Let M denote the DFA constructed by swapping the accept and non-accepting state in M. Solution Prolem Set 2 Prolem.4 () Let M denote the DFA contructed y wpping the ccept nd non-ccepting tte in M. For ny tring w B, w will e ccepted y M, tht i, fter conuming the tring w, M will e in n ccepting

More information

Name Ima Sample ASU ID

Name Ima Sample ASU ID Nme Im Smple ASU ID 2468024680 CSE 355 Test 1, Fll 2016 30 Septemer 2016, 8:35-9:25.m., LSA 191 Regrding of Midterms If you elieve tht your grde hs not een dded up correctly, return the entire pper to

More information

1 Nondeterministic Finite Automata

1 Nondeterministic Finite Automata 1 Nondeterministic Finite Automt Suppose in life, whenever you hd choice, you could try oth possiilities nd live your life. At the end, you would go ck nd choose the one tht worked out the est. Then you

More information

Resistors. Consider a uniform cylinder of material with mediocre to poor to pathetic conductivity ( )

Resistors. Consider a uniform cylinder of material with mediocre to poor to pathetic conductivity ( ) 10/25/2005 Resistors.doc 1/7 Resistors Consider uniform cylinder of mteril with mediocre to poor to r. pthetic conductivity ( ) ˆ This cylinder is centered on the -xis, nd hs length. The surfce re of the

More information

Improper Integrals. Introduction. Type 1: Improper Integrals on Infinite Intervals. When we defined the definite integral.

Improper Integrals. Introduction. Type 1: Improper Integrals on Infinite Intervals. When we defined the definite integral. Improper Integrls Introduction When we defined the definite integrl f d we ssumed tht f ws continuous on [, ] where [, ] ws finite, closed intervl There re t lest two wys this definition cn fil to e stisfied:

More information

8. Complex Numbers. We can combine the real numbers with this new imaginary number to form the complex numbers.

8. Complex Numbers. We can combine the real numbers with this new imaginary number to form the complex numbers. 8. Complex Numers The rel numer system is dequte for solving mny mthemticl prolems. But it is necessry to extend the rel numer system to solve numer of importnt prolems. Complex numers do not chnge the

More information

M597K: Solution to Homework Assignment 7

M597K: Solution to Homework Assignment 7 M597K: Solution to Homework Assignment 7 The following problems re on the specified pges of the text book by Keener (2nd Edition, i.e., revised nd updted version) Problems 3 nd 4 of Section 2.1 on p.94;

More information

On Determinisation of History-Deterministic Automata.

On Determinisation of History-Deterministic Automata. On Deterministion of History-Deterministic Automt. Denis Kupererg Mich l Skrzypczk University of Wrsw YR-ICALP 2014 Copenhgen Introduction Deterministic utomt re centrl tool in utomt theory: Polynomil

More information

The Modified Heinz s Inequality

The Modified Heinz s Inequality Journl of Applied Mthemtics nd Physics, 03,, 65-70 Pulished Online Novemer 03 (http://wwwscirporg/journl/jmp) http://dxdoiorg/0436/jmp03500 The Modified Heinz s Inequlity Tkshi Yoshino Mthemticl Institute,

More information

COSC 3361 Numerical Analysis I Numerical Integration and Differentiation (III) - Gauss Quadrature and Adaptive Quadrature

COSC 3361 Numerical Analysis I Numerical Integration and Differentiation (III) - Gauss Quadrature and Adaptive Quadrature COSC 336 Numericl Anlysis I Numericl Integrtion nd Dierentition III - Guss Qudrture nd Adptive Qudrture Edgr Griel Fll 5 COSC 336 Numericl Anlysis I Edgr Griel Summry o the lst lecture I For pproximting

More information

6.5 Improper integrals

6.5 Improper integrals Eerpt from "Clulus" 3 AoPS In. www.rtofprolemsolving.om 6.5. IMPROPER INTEGRALS 6.5 Improper integrls As we ve seen, we use the definite integrl R f to ompute the re of the region under the grph of y =

More information

CS 373, Spring Solutions to Mock midterm 1 (Based on first midterm in CS 273, Fall 2008.)

CS 373, Spring Solutions to Mock midterm 1 (Based on first midterm in CS 273, Fall 2008.) CS 373, Spring 29. Solutions to Mock midterm (sed on first midterm in CS 273, Fll 28.) Prolem : Short nswer (8 points) The nswers to these prolems should e short nd not complicted. () If n NF M ccepts

More information

C/CS/Phys C191 Bell Inequalities, No Cloning, Teleportation 9/13/07 Fall 2007 Lecture 6

C/CS/Phys C191 Bell Inequalities, No Cloning, Teleportation 9/13/07 Fall 2007 Lecture 6 C/CS/Phys C9 Bell Inequlities, o Cloning, Teleporttion 9/3/7 Fll 7 Lecture 6 Redings Benenti, Csti, nd Strini: o Cloning Ch.4. Teleporttion Ch. 4.5 Bell inequlities See lecture notes from H. Muchi, Cltech,

More information

9.4. The Vector Product. Introduction. Prerequisites. Learning Outcomes

9.4. The Vector Product. Introduction. Prerequisites. Learning Outcomes The Vector Product 9.4 Introduction In this section we descrie how to find the vector product of two vectors. Like the sclr product its definition my seem strnge when first met ut the definition is chosen

More information

CHAPTER 1 Regular Languages. Contents

CHAPTER 1 Regular Languages. Contents Finite Automt (FA or DFA) CHAPTE 1 egulr Lnguges Contents definitions, exmples, designing, regulr opertions Non-deterministic Finite Automt (NFA) definitions, euivlence of NFAs nd DFAs, closure under regulr

More information

4.1. Probability Density Functions

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

More information

Good-for-Games Automata versus Deterministic Automata.

Good-for-Games Automata versus Deterministic Automata. Good-for-Gmes Automt versus Deterministic Automt. Denis Kuperberg 1,2 Mich l Skrzypczk 1 1 University of Wrsw 2 IRIT/ONERA (Toulouse) Séminire MoVe 12/02/2015 LIF, Luminy Introduction Deterministic utomt

More information

MTH 505: Number Theory Spring 2017

MTH 505: Number Theory Spring 2017 MTH 505: Numer Theory Spring 207 Homework 2 Drew Armstrong The Froenius Coin Prolem. Consider the eqution x ` y c where,, c, x, y re nturl numers. We cn think of $ nd $ s two denomintions of coins nd $c

More information

10. AREAS BETWEEN CURVES

10. AREAS BETWEEN CURVES . AREAS BETWEEN CURVES.. Ares etween curves So res ove the x-xis re positive nd res elow re negtive, right? Wrong! We lied! Well, when you first lern out integrtion it s convenient fiction tht s true in

More information

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

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

More information

Pre-Lie algebras, rooted trees and related algebraic structures

Pre-Lie algebras, rooted trees and related algebraic structures Pre-Lie lgers, rooted trees nd relted lgeri strutures Mrh 23, 2004 Definition 1 A pre-lie lger is vetor spe W with mp : W W W suh tht (x y) z x (y z) = (x z) y x (z y). (1) Exmple 2 All ssoitive lgers

More information

NON-DETERMINISTIC FSA

NON-DETERMINISTIC FSA Tw o types of non-determinism: NON-DETERMINISTIC FS () Multiple strt-sttes; strt-sttes S Q. The lnguge L(M) ={x:x tkes M from some strt-stte to some finl-stte nd ll of x is proessed}. The string x = is

More information

Non-deterministic Finite Automata

Non-deterministic Finite Automata Non-deterministic Finite Automt From Regulr Expressions to NFA- Eliminting non-determinism Rdoud University Nijmegen Non-deterministic Finite Automt H. Geuvers nd J. Rot Institute for Computing nd Informtion

More information

Calculus Module C21. Areas by Integration. Copyright This publication The Northern Alberta Institute of Technology All Rights Reserved.

Calculus Module C21. Areas by Integration. Copyright This publication The Northern Alberta Institute of Technology All Rights Reserved. Clculus Module C Ares Integrtion Copright This puliction The Northern Alert Institute of Technolog 7. All Rights Reserved. LAST REVISED Mrch, 9 Introduction to Ares Integrtion Sttement of Prerequisite

More information

INF1383 -Bancos de Dados

INF1383 -Bancos de Dados 3//0 INF383 -ncos de Ddos Prof. Sérgio Lifschitz DI PUC-Rio Eng. Computção, Sistems de Informção e Ciênci d Computção LGER RELCIONL lguns slides sedos ou modificdos dos originis em Elmsri nd Nvthe, Fundmentls

More information

How do we solve these things, especially when they get complicated? How do we know when a system has a solution, and when is it unique?

How do we solve these things, especially when they get complicated? How do we know when a system has a solution, and when is it unique? XII. LINEAR ALGEBRA: SOLVING SYSTEMS OF EQUATIONS Tody we re going to tlk out solving systems of liner equtions. These re prolems tht give couple of equtions with couple of unknowns, like: 6= x + x 7=

More information

LINEAR ALGEBRA APPLIED

LINEAR ALGEBRA APPLIED 5.5 Applictions of Inner Product Spces 5.5 Applictions of Inner Product Spces 7 Find the cross product of two vectors in R. Find the liner or qudrtic lest squres pproimtion of function. Find the nth-order

More information

SCHOOL OF ENGINEERING & BUILT ENVIRONMENT. Mathematics

SCHOOL OF ENGINEERING & BUILT ENVIRONMENT. Mathematics SCHOOL OF ENGINEERING & BUIL ENVIRONMEN Mthemtics An Introduction to Mtrices Definition of Mtri Size of Mtri Rows nd Columns of Mtri Mtri Addition Sclr Multipliction of Mtri Mtri Multipliction 7 rnspose

More information

A Tableau Prover for Hybrid Logic. Daniel Götzmann Graduate Seminar Programming Systems Lab Advisor: Mark Kaminski

A Tableau Prover for Hybrid Logic. Daniel Götzmann Graduate Seminar Programming Systems Lab Advisor: Mark Kaminski A Tbleu Prover for Hybrid Logic Dniel Götzmnn Grdute Seminr Progrmming Systems Lb 2008-07-14 Advisor: Mrk Kminski Bsic Modl Logic s ::= p s s s s s propositionl logic Bsic Modl Logic s ::= p s s s s s

More information

u( t) + K 2 ( ) = 1 t > 0 Analyzing Damped Oscillations Problem (Meador, example 2-18, pp 44-48): Determine the equation of the following graph.

u( t) + K 2 ( ) = 1 t > 0 Analyzing Damped Oscillations Problem (Meador, example 2-18, pp 44-48): Determine the equation of the following graph. nlyzing Dmped Oscilltions Prolem (Medor, exmple 2-18, pp 44-48): Determine the eqution of the following grph. The eqution is ssumed to e of the following form f ( t) = K 1 u( t) + K 2 e!"t sin (#t + $

More information