Syntactic Complexity of Suffix-Free Languages. Marek Szykuła
|
|
- Shannon Houston
- 5 years ago
- Views:
Transcription
1 Inroducion Upper Bound on Synacic Complexiy of Suffix-Free Language Univeriy of Wrocław, Poland Join work wih Januz Brzozowki Univeriy of Waerloo, Canada DCFS,
2 Abrac Inroducion Sae and ynacic complexiy Suffix-free language We udy ynacic complexiy of he cla of uffix-free language: A language L i uffix-free if w = uv L, where u i non-empy, implie ha he uffix v L. Conribuion Brzozowki, Li, and Ye (TCS 2012) conjecured ha: For n 6, he ynacic complexiy of uffix-free language i (n 1) n 2 + n 2. For n 6, he ynacic complexiy of bifix-free language i (n 1) n 3 +(n 2) n 3 +(n 3)2 n 3. For n 6, he ynacic complexiy of facor-free language i (n 1) n 3 +(n 3)2 n We prove he fir conjecure (abou uffix-free language).
3 Lef quoien Inroducion Sae and ynacic complexiy Suffix-free language The (lef) quoien of a regular language L by a word w i w 1 L = {x Σ wx L}. Analogouly, for a ae q of a minimal DFA A = (Q,Σ,δ,q 0,F) recognizing L: L q = {x Σ q x F}, where x i he ranformaion induced by word x. So L q i he e of word aking q o an acceping ae.
4 Lef quoien Inroducion Sae and ynacic complexiy Suffix-free language The (lef) quoien of a regular language L by a word w i w 1 L = {x Σ wx L}. Analogouly, for a ae q of a minimal DFA A = (Q,Σ,δ,q 0,F) recognizing L: L q = {x Σ q x F}, where x i he ranformaion induced by word x. So L q i he e of word aking q o an acceping ae.
5 Lef quoien Inroducion Sae and ynacic complexiy Suffix-free language The (lef) quoien of a regular language L by a word w i w 1 L = {x Σ wx L}. Analogouly, for a ae q of a minimal DFA A = (Q,Σ,δ,q 0,F) recognizing L: L q = {x Σ q x F}, where x i he ranformaion induced by word x. So L q i he e of word aking q o an acceping ae.
6 Sae complexiy Inroducion Sae and ynacic complexiy Suffix-free language Nerode righ congruence on Σ For a regular language L and word x,y Σ : x L y if and only if xv L yv L, for all v Σ Sae complexiy The ae complexiy or quoien complexiy κ(l) of a regular language L i: The number of equivalence clae of L. The number of lef quoien of L. The number of ae in a minimal DFA recognizing L.
7 Synacic complexiy Inroducion Sae and ynacic complexiy Suffix-free language Myhill congruence For a regular language L and word x,y Σ : x L y if and only if uxv L uyv L for all u,v Σ Synacic complexiy The ynacic complexiy σ(l) of a regular language L i: Σ + / L he number of equivalence clae of L. The ize of he ynacic emigroup of L. The ize of he raniion emigroup of a minimal DFA recognizing L.
8 Inroducion Sae and ynacic complexiy Suffix-free language Synacic complexiy of a cla of language The ynacic complexiy of a cla of language i: The ize of he large ynacic emigroup of language in ha cla. Expreed a a funcion of he ae complexiie n = κ(l) of he language. In oher word Suppoe we have an n-ae minimal DFA recognizing ome language from he given cla. We ak how many ranformaion (a mo) can be in he raniion emigroup of he DFA.
9 Inroducion Sae and ynacic complexiy Suffix-free language Synacic complexiy of a cla of language The ynacic complexiy of a cla of language i: The ize of he large ynacic emigroup of language in ha cla. Expreed a a funcion of he ae complexiie n = κ(l) of he language. In oher word Suppoe we have an n-ae minimal DFA recognizing ome language from he given cla. We ak how many ranformaion (a mo) can be in he raniion emigroup of he DFA.
10 Inroducion Sae and ynacic complexiy Suffix-free language Propoiion n 1 σ(l) n n The bound are igh for n > 1 in he cla of all regular language.
11 Previou reul Inroducion Sae and ynacic complexiy Suffix-free language Gome, Howie 1992: (parially) monoonic emigroup. Krawez, Lawrence, Shalli 2003: unary and binary alphabe. Holzer, König 2004: unary and binary alphabe. Brzozowki, Ye 2010: ideal and cloed language. Beaudry, Holzer 2011: emigroup of reverible DFA. Brzozowki, Liu 2012: finie, cofinie, definie, revere definie language. Brzozowki, Li, Ye 2012: prefix-, uffix-, bifix-, facor-free language. Iván, Nagy-György 2013: (generalized) definie language. Brzozowki, Li 2013: J -rivial and R-rivial language. Brzozowki, Li, Liu 2013: aperiodic, nearly monoonic emigroup. Brzozowki, Szykuła 2014: aperiodic emigroup. Brzozowki, Szykuła 2014: lef and wo-ided ideal language.
12 Suffix-free language Inroducion Sae and ynacic complexiy Suffix-free language Suffix-free language A language L i uffix-free if w = uv L, where u i non-empy, implie ha he uffix v L. Baic properie L ha he empy quoien. For w,x Σ +, if w 1 L hen w 1 L (xw) 1 L. For w Σ, he chain of quoien w 1 L,(ww) 1 L,... end in.
13 Inroducion Sae and ynacic complexiy Suffix-free language Synacic complexiy of uffix-free language Brzozowki, Li, Ye 2012 Here Two maximal emigroup were inroduced: W 5 (n) and W 6 (n). For n 5 he large raniion emigroup i W 5 (n). For n = 6 a large raniion emigroup i W 6 (n). I wa conjecured ha W 6 (n) i alo large for all n 7. The ize of W 6 (n) i (n 1) n 2 +(n 2). We have proved ha W 6 (n) i he unique large raniion emigroup for n 7.
14 Inroducion Sae and ynacic complexiy Suffix-free language Synacic complexiy of uffix-free language Brzozowki, Li, Ye 2012 Here Two maximal emigroup were inroduced: W 5 (n) and W 6 (n). For n 5 he large raniion emigroup i W 5 (n). For n = 6 a large raniion emigroup i W 6 (n). I wa conjecured ha W 6 (n) i alo large for all n 7. The ize of W 6 (n) i (n 1) n 2 +(n 2). We have proved ha W 6 (n) i he unique large raniion emigroup for n 7.
15 Inroducion Sae and ynacic complexiy Suffix-free language Properie of DFA of uffix-free language Le D = (Q,Σ,δ,0,F) be a minimal DFA of a uffix-free language. Q = {0,1,...,n 1}. 0 i he ar ae. n 1 i he empy ae. Le T n be he raniion emigroup of D. Baic propery For any ranformaion T n and any ae q Q \{0}, we have 0 q unle 0 = q = n 1.
16 Inroducion Sae and ynacic complexiy Suffix-free language Properie of DFA of uffix-free language Le D = (Q,Σ,δ,0,F) be a minimal DFA of a uffix-free language. Q = {0,1,...,n 1}. 0 i he ar ae. n 1 i he empy ae. Le T n be he raniion emigroup of D. Baic propery For any ranformaion T n and any ae q Q \{0}, we have 0 q unle 0 = q = n 1.
17 Colliding pair of ae Inroducion Sae and ynacic complexiy Suffix-free language Definiion Two ae p,q Q are colliding in T n, if here i a ranformaion T n uch ha: 0 = p, r = q for ome ae r Q \{0,n 1}. No ranformaion can map a pair of colliding ae o a ingle ae, excep o n 1. u r q 0 p... n 1
18 Colliding pair of ae Inroducion Sae and ynacic complexiy Suffix-free language Definiion Two ae p,q Q are colliding in T n, if here i a ranformaion T n uch ha: 0 = p, r = q for ome ae r Q \{0,n 1}. No ranformaion can map a pair of colliding ae o a ingle ae, excep o n 1. u r q 0 p... n 1
19 Colliding ae Inroducion Sae and ynacic complexiy Suffix-free language Remark In W 5 (n) all pair p,q Q \{0,n 1} are colliding. In W 6 (n) here are no colliding pair.
20 Inroducion The wine (lower bound) The proof of he upper bound Wine DFA wih he raniion emigroup W 6 (n) generaed by 5 leer. c c, d a, b 0 e 1 b 2 a... a n 2 a, c b, c, d b, d Σ\{e} d, e e e n 1 Σ
21 Inroducion The wine (lower bound) The proof of he upper bound Le S n = W 6 (n) be he raniion emigroup of he wine The raniion emigroup S n S n conain: All ranformaion ha map 0 o n 1. All ranformaion ha map 0 o a ae in {1,...,n 2}, and all oher ae o n 1. Thee are (n 1) n 2 +(n 2) ranformaion in oal.
22 Inroducion The wine (lower bound) The proof of he upper bound Idea We aume n 7. S n i he raniion emigroup of he wine. T n i he raniion emigroup of an arbirary DFA of a uffix-free language. We how ha T n S n = (n 1) n 2 +(n 2). I i poible ha T n S n. We conruc an injecive funcion: ϕ: T n S n (Injecive: for every we have ϕ() ϕ( ).)
23 Inroducion The wine (lower bound) The proof of he upper bound Idea We aume n 7. S n i he raniion emigroup of he wine. T n i he raniion emigroup of an arbirary DFA of a uffix-free language. We how ha T n S n = (n 1) n 2 +(n 2). I i poible ha T n S n. We conruc an injecive funcion: ϕ: T n S n (Injecive: for every we have ϕ() ϕ( ).)
24 Inroducion The wine (lower bound) The proof of he upper bound Idea We aume n 7. S n i he raniion emigroup of he wine. T n i he raniion emigroup of an arbirary DFA of a uffix-free language. We how ha T n S n = (n 1) n 2 +(n 2). I i poible ha T n S n. We conruc an injecive funcion: ϕ: T n S n (Injecive: for every we have ϕ() ϕ( ).)
25 Cae 1 Inroducion The wine (lower bound) The proof of he upper bound If S n, hen le ϕ() =. Thi i obviouly injecive, and ϕ() T n. From now, for S n we need o aign a ranformaion ϕ() T n.
26 Cae 1 Inroducion The wine (lower bound) The proof of he upper bound If S n, hen le ϕ() =. Thi i obviouly injecive, and ϕ() T n. From now, for S n we need o aign a ranformaion ϕ() T n.
27 Cae 2 Inroducion The wine (lower bound) The proof of he upper bound If S n and ha a cycle, hen we revere he chain p,p,... and map p o a minimal ae ha appear in cycle. : r r... 0 p... p k n 1 : r r... 0 p... p k n 1
28 Cae 2 Inroducion The wine (lower bound) The proof of he upper bound If S n and ha a cycle, hen we revere he chain p,p,... and map p o a minimal ae ha appear in cycle. : r r... 0 p... p k n 1 : r r... 0 p... p k n 1
29 Cae 3 Inroducion The wine (lower bound) The proof of he upper bound If S n and ha no cycle, hen we revere he chain and make p a fixed poin. : 0 p... p k n 1 : 0 p... p k n 1
30 Cae 11 wih p < r Inroducion The wine (lower bound) The proof of he upper bound : q r r 1 r 2 0 p n 1 : q r r 1 r 2 0 p n 1
31 Cae 11 wih p > r Inroducion The wine (lower bound) The proof of he upper bound : q r r 1 r 2 0 p n 1 : q r r 1 r 2 0 p n 1
32 The la cae 12 Inroducion The wine (lower bound) The proof of he upper bound : : f r 1 r p n 1 f r 1 r p n 1
33 We have 12 cae Inroducion The wine (lower bound) The proof of he upper bound Cae 1 S n. Cae 2 ha a cycle. Cae 3 p n 1. Cae 4 There i a fixed poin r Q \{0, n 1} wih in-degree 2. Cae 5 There i r wih in-degree 1 ha i no a fixed poin and r n 1. Cae 6 There i r Q \{0, n 1} wih in-degree 2. Cae 7 There are q 1,q 2 Q \{0, n 1} ha are no fixed poin and aify q 1 n 1 and q 2 n 1. Cae 8 There are wo fixed poin r 1 and r 2 in Q \{0, n 1} wih in-degree 1. Cae 9 There i q Q \{0, n 1} ha i no a fixed poin and aifie q n 1, p < q, and a fixed poin f n 1. Cae 10 There i q Q \{0, n 1} ha i no a fixed poin and aifie q n 1, and a fixed poin f n 1. Cae 11 There i q Q \{0, n 1} ha i no a fixed poin and aifie q n 1. Cae 12 Any oher ranformaion. In each cae we aume ha doe no belong o he previou cae.
34 Summary Inroducion The wine (lower bound) The proof of he upper bound The 12 cae cover all poibiliie for. Funcion ϕ i injecive and ϕ(t n ) S n, and T n = ϕ(t n ) S n.
35 Inroducion Uniquene of maximaliy The wine (lower bound) The proof of he upper bound Theorem For n 7, he raniion emigroup S n of he wine i he only one reaching he upper bound. Theorem Five leer are neceary o generae S n. So five leer are needed o reach he upper bound.
36 Fuure work Inroducion The wine (lower bound) The proof of he upper bound Oher problem The echnique of injecive funcion can be applied o imilar problem. Earlier, we olved he problem of ynacic complexiy of lef ideal (5 ubcae) and wo-ided ideal (8 ubcae) (DLT 2014). The problem of upper bound for ynacic complexiy of bifix- and facor-free language remain open. Thank you!
37 Fuure work Inroducion The wine (lower bound) The proof of he upper bound Oher problem The echnique of injecive funcion can be applied o imilar problem. Earlier, we olved he problem of ynacic complexiy of lef ideal (5 ubcae) and wo-ided ideal (8 ubcae) (DLT 2014). The problem of upper bound for ynacic complexiy of bifix- and facor-free language remain open. Thank you!
CS4445/9544 Analysis of Algorithms II Solution for Assignment 1
Conider he following flow nework CS444/944 Analyi of Algorihm II Soluion for Aignmen (0 mark) In he following nework a minimum cu ha capaciy 0 Eiher prove ha hi aemen i rue, or how ha i i fale Uing he
More informationFLAT CYCLOTOMIC POLYNOMIALS OF ORDER FOUR AND HIGHER
#A30 INTEGERS 10 (010), 357-363 FLAT CYCLOTOMIC POLYNOMIALS OF ORDER FOUR AND HIGHER Nahan Kaplan Deparmen of Mahemaic, Harvard Univeriy, Cambridge, MA nkaplan@mah.harvard.edu Received: 7/15/09, Revied:
More informationProblem Set If all directed edges in a network have distinct capacities, then there is a unique maximum flow.
CSE 202: Deign and Analyi of Algorihm Winer 2013 Problem Se 3 Inrucor: Kamalika Chaudhuri Due on: Tue. Feb 26, 2013 Inrucion For your proof, you may ue any lower bound, algorihm or daa rucure from he ex
More informationT-Rough Fuzzy Subgroups of Groups
Journal of mahemaic and compuer cience 12 (2014), 186-195 T-Rough Fuzzy Subgroup of Group Ehagh Hoeinpour Deparmen of Mahemaic, Sari Branch, Ilamic Azad Univeriy, Sari, Iran. hoienpor_a51@yahoo.com Aricle
More informationNetwork Flows: Introduction & Maximum Flow
CSC 373 - lgorihm Deign, nalyi, and Complexiy Summer 2016 Lalla Mouaadid Nework Flow: Inroducion & Maximum Flow We now urn our aenion o anoher powerful algorihmic echnique: Local Search. In a local earch
More informationEECE 301 Signals & Systems Prof. Mark Fowler
EECE 31 Signal & Syem Prof. Mark Fowler Noe Se #27 C-T Syem: Laplace Tranform Power Tool for yem analyi Reading Aignmen: Secion 6.1 6.3 of Kamen and Heck 1/18 Coure Flow Diagram The arrow here how concepual
More informationIntroduction to Congestion Games
Algorihmic Game Theory, Summer 2017 Inroducion o Congeion Game Lecure 1 (5 page) Inrucor: Thoma Keelheim In hi lecure, we ge o know congeion game, which will be our running example for many concep in game
More informationFractional Ornstein-Uhlenbeck Bridge
WDS'1 Proceeding of Conribued Paper, Par I, 21 26, 21. ISBN 978-8-7378-139-2 MATFYZPRESS Fracional Ornein-Uhlenbeck Bridge J. Janák Charle Univeriy, Faculy of Mahemaic and Phyic, Prague, Czech Republic.
More information1 Motivation and Basic Definitions
CSCE : Deign and Analyi of Algorihm Noe on Max Flow Fall 20 (Baed on he preenaion in Chaper 26 of Inroducion o Algorihm, 3rd Ed. by Cormen, Leieron, Rive and Sein.) Moivaion and Baic Definiion Conider
More informationAverage Case Lower Bounds for Monotone Switching Networks
Average Cae Lower Bound for Monoone Swiching Nework Yuval Filmu, Toniann Piai, Rober Robere, Sephen Cook Deparmen of Compuer Science Univeriy of Torono Monoone Compuaion (Refreher) Monoone circui were
More informationThe multisubset sum problem for finite abelian groups
Alo available a hp://amc-journal.eu ISSN 1855-3966 (prined edn.), ISSN 1855-3974 (elecronic edn.) ARS MATHEMATICA CONTEMPORANEA 8 (2015) 417 423 The muliube um problem for finie abelian group Amela Muraović-Ribić
More informationOn the Exponential Operator Functions on Time Scales
dvance in Dynamical Syem pplicaion ISSN 973-5321, Volume 7, Number 1, pp. 57 8 (212) hp://campu.m.edu/ada On he Exponenial Operaor Funcion on Time Scale laa E. Hamza Cairo Univeriy Deparmen of Mahemaic
More informationFlow networks. Flow Networks. A flow on a network. Flow networks. The maximum-flow problem. Introduction to Algorithms, Lecture 22 December 5, 2001
CS 545 Flow Nework lon Efra Slide courey of Charle Leieron wih mall change by Carola Wenk Flow nework Definiion. flow nework i a direced graph G = (V, E) wih wo diinguihed verice: a ource and a ink. Each
More informationGeneralized Orlicz Spaces and Wasserstein Distances for Convex-Concave Scale Functions
Generalized Orlicz Space and Waerein Diance for Convex-Concave Scale Funcion Karl-Theodor Surm Abrac Given a ricly increaing, coninuou funcion ϑ : R + R +, baed on he co funcional ϑ (d(x, y dq(x, y, we
More informationMain Reference: Sections in CLRS.
Maximum Flow Reied 09/09/200 Main Reference: Secion 26.-26. in CLRS. Inroducion Definiion Muli-Source Muli-Sink The Ford-Fulkeron Mehod Reidual Nework Augmening Pah The Max-Flow Min-Cu Theorem The Edmond-Karp
More information6.8 Laplace Transform: General Formulas
48 HAP. 6 Laplace Tranform 6.8 Laplace Tranform: General Formula Formula Name, ommen Sec. F() l{ f ()} e f () d f () l {F()} Definiion of Tranform Invere Tranform 6. l{af () bg()} al{f ()} bl{g()} Lineariy
More informationAlgorithmic Discrete Mathematics 6. Exercise Sheet
Algorihmic Dicree Mahemaic. Exercie Shee Deparmen of Mahemaic SS 0 PD Dr. Ulf Lorenz 7. and 8. Juni 0 Dipl.-Mah. David Meffer Verion of June, 0 Groupwork Exercie G (Heap-Sor) Ue Heap-Sor wih a min-heap
More informationNECESSARY AND SUFFICIENT CONDITIONS FOR LATENT SEPARABILITY
NECESSARY AND SUFFICIENT CONDITIONS FOR LATENT SEPARABILITY Ian Crawford THE INSTITUTE FOR FISCAL STUDIES DEPARTMENT OF ECONOMICS, UCL cemmap working paper CWP02/04 Neceary and Sufficien Condiion for Laen
More informationFUZZY n-inner PRODUCT SPACE
Bull. Korean Mah. Soc. 43 (2007), No. 3, pp. 447 459 FUZZY n-inner PRODUCT SPACE Srinivaan Vijayabalaji and Naean Thillaigovindan Reprined from he Bullein of he Korean Mahemaical Sociey Vol. 43, No. 3,
More information18 Extensions of Maximum Flow
Who are you?" aid Lunkwill, riing angrily from hi ea. Wha do you wan?" I am Majikhie!" announced he older one. And I demand ha I am Vroomfondel!" houed he younger one. Majikhie urned on Vroomfondel. I
More informationIntroduction to SLE Lecture Notes
Inroducion o SLE Lecure Noe May 13, 16 - The goal of hi ecion i o find a ufficien condiion of λ for he hull K o be generaed by a imple cure. I urn ou if λ 1 < 4 hen K i generaed by a imple curve. We will
More informationFIXED POINTS AND STABILITY IN NEUTRAL DIFFERENTIAL EQUATIONS WITH VARIABLE DELAYS
PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY Volume 136, Number 3, March 28, Page 99 918 S 2-9939(7)989-2 Aricle elecronically publihed on November 3, 27 FIXED POINTS AND STABILITY IN NEUTRAL DIFFERENTIAL
More informationCHAPTER 7. Definition and Properties. of Laplace Transforms
SERIES OF CLSS NOTES FOR 5-6 TO INTRODUCE LINER ND NONLINER PROBLEMS TO ENGINEERS, SCIENTISTS, ND PPLIED MTHEMTICINS DE CLSS NOTES COLLECTION OF HNDOUTS ON SCLR LINER ORDINRY DIFFERENTIL EQUTIONS (ODE")
More informationAlgorithms and Data Structures 2011/12 Week 9 Solutions (Tues 15th - Fri 18th Nov)
Algorihm and Daa Srucure 2011/ Week Soluion (Tue 15h - Fri 18h No) 1. Queion: e are gien 11/16 / 15/20 8/13 0/ 1/ / 11/1 / / To queion: (a) Find a pair of ube X, Y V uch ha f(x, Y) = f(v X, Y). (b) Find
More informationLower and Upper Approximation of Fuzzy Ideals in a Semiring
nernaional Journal of Scienific & Engineering eearch, Volume 3, ue, January-0 SSN 9-558 Lower and Upper Approximaion of Fuzzy deal in a Semiring G Senhil Kumar, V Selvan Abrac n hi paper, we inroduce he
More informationGraphs III - Network Flow
Graph III - Nework Flow Flow nework eup graph G=(V,E) edge capaciy w(u,v) 0 - if edge doe no exi, hen w(u,v)=0 pecial verice: ource verex ; ink verex - no edge ino and no edge ou of Aume every verex v
More informationRandomized Perfect Bipartite Matching
Inenive Algorihm Lecure 24 Randomized Perfec Biparie Maching Lecurer: Daniel A. Spielman April 9, 208 24. Inroducion We explain a randomized algorihm by Ahih Goel, Michael Kapralov and Sanjeev Khanna for
More informationNote on Matuzsewska-Orlich indices and Zygmund inequalities
ARMENIAN JOURNAL OF MATHEMATICS Volume 3, Number 1, 21, 22 31 Noe on Mauzewka-Orlic indice and Zygmund inequaliie N. G. Samko Univeridade do Algarve, Campu de Gambela, Faro,85 139, Porugal namko@gmail.com
More informationCHAPTER 7: SECOND-ORDER CIRCUITS
EEE5: CI RCUI T THEORY CHAPTER 7: SECOND-ORDER CIRCUITS 7. Inroducion Thi chaper conider circui wih wo orage elemen. Known a econd-order circui becaue heir repone are decribed by differenial equaion ha
More informationCS 473G Lecture 15: Max-Flow Algorithms and Applications Fall 2005
CS 473G Lecure 1: Max-Flow Algorihm and Applicaion Fall 200 1 Max-Flow Algorihm and Applicaion (November 1) 1.1 Recap Fix a direced graph G = (V, E) ha doe no conain boh an edge u v and i reveral v u,
More informationNetwork Flow. Data Structures and Algorithms Andrei Bulatov
Nework Flow Daa Srucure and Algorihm Andrei Bulao Algorihm Nework Flow 24-2 Flow Nework Think of a graph a yem of pipe We ue hi yem o pump waer from he ource o ink Eery pipe/edge ha limied capaciy Flow
More informationu(t) Figure 1. Open loop control system
Open loop conrol v cloed loop feedbac conrol The nex wo figure preen he rucure of open loop and feedbac conrol yem Figure how an open loop conrol yem whoe funcion i o caue he oupu y o follow he reference
More informationarxiv: v2 [cs.cg] 30 Apr 2015
Diffue Reflecion Diameer in Simple Polygon arxiv:1302.2271v2 [c.cg] 30 Apr 2015 Gill Bareque Deparmen of Compuer Science Technion Haifa, Irael bareque@c.echnion.ac.il Eli Fox-Epein Deparmen of Compuer
More informationLet. x y. denote a bivariate time series with zero mean.
Linear Filer Le x y : T denoe a bivariae ime erie wih zero mean. Suppoe ha he ime erie {y : T} i conruced a follow: y a x The ime erie {y : T} i aid o be conruced from {x : T} by mean of a Linear Filer.
More information, the. L and the L. x x. max. i n. It is easy to show that these two norms satisfy the following relation: x x n x = (17.3) max
ecure 8 7. Sabiliy Analyi For an n dimenional vecor R n, he and he vecor norm are defined a: = T = i n i (7.) I i eay o how ha hee wo norm aify he following relaion: n (7.) If a vecor i ime-dependen, hen
More informationLecture 21. The Lovasz splitting-off lemma Topics in Combinatorial Optimization April 29th, 2004
18.997 Topic in Combinatorial Optimization April 29th, 2004 Lecture 21 Lecturer: Michel X. Goeman Scribe: Mohammad Mahdian 1 The Lovaz plitting-off lemma Lovaz plitting-off lemma tate the following. Theorem
More informationSpider Diagrams: a diagrammatic reasoning system
Spider iagram: a diagrammaic reaoning yem John Howe, Fernando Molina, John Taylor School of Compuing and Mahemaical Science niveriy of righon, K {John.Howe, F.Molina, John.Taylor}@brighon.ac.uk Suar Ken
More informationCSC 364S Notes University of Toronto, Spring, The networks we will consider are directed graphs, where each edge has associated with it
CSC 36S Noe Univeriy of Torono, Spring, 2003 Flow Algorihm The nework we will conider are direced graph, where each edge ha aociaed wih i a nonnegaive capaciy. The inuiion i ha if edge (u; v) ha capaciy
More informationof Manchester The University COMP14112 Hidden Markov Models
COMP42 Lecure 8 Hidden Markov Model he Univeriy of Mancheer he Univeriy of Mancheer Hidden Markov Model a b2 0. 0. SAR 0.9 0.9 SOP b 0. a2 0. Imagine he and 2 are hidden o he daa roduced i a equence of
More informationSpider Diagrams: a diagrammatic reasoning system
Spider iagram: a diagrammaic reaoning yem John Howe, Fernando Molina, John Taylor School of Compuing and Mahemaical Science niveriy of righon, K {John.Howe, F.Molina, John.Taylor}@brighon.ac.uk Suar Ken
More informationLinear Algebra Primer
Linear Algebra rimer And a video dicuion of linear algebra from EE263 i here (lecure 3 and 4): hp://ee.anford.edu/coure/ee263 lide from Sanford CS3 Ouline Vecor and marice Baic Mari Operaion Deerminan,
More information2. VECTORS. R Vectors are denoted by bold-face characters such as R, V, etc. The magnitude of a vector, such as R, is denoted as R, R, V
ME 352 VETS 2. VETS Vecor algebra form he mahemaical foundaion for kinemaic and dnamic. Geomer of moion i a he hear of boh he kinemaic and dnamic of mechanical em. Vecor anali i he imehonored ool for decribing
More informationChallenge Problems. DIS 203 and 210. March 6, (e 2) k. k(k + 2). k=1. f(x) = k(k + 2) = 1 x k
Challenge Problems DIS 03 and 0 March 6, 05 Choose one of he following problems, and work on i in your group. Your goal is o convince me ha your answer is correc. Even if your answer isn compleely correc,
More informationARTIFICIAL INTELLIGENCE. Markov decision processes
INFOB2KI 2017-2018 Urech Univeriy The Neherland ARTIFICIAL INTELLIGENCE Markov deciion procee Lecurer: Silja Renooij Thee lide are par of he INFOB2KI Coure Noe available from www.c.uu.nl/doc/vakken/b2ki/chema.hml
More information4/12/12. Applications of the Maxflow Problem 7.5 Bipartite Matching. Bipartite Matching. Bipartite Matching. Bipartite matching: the flow network
// Applicaion of he Maxflow Problem. Biparie Maching Biparie Maching Biparie maching. Inpu: undireced, biparie graph = (, E). M E i a maching if each node appear in a mo one edge in M. Max maching: find
More informationA Logic of Orthogonality
A Logic of Orhogonaliy J. Adámek, M. Héber and L. Soua Sepember 3, 2006 Thi paper wa inpired by he hard-o-believe fac ha Jiří Roický i geing ixy. We are happy o dedicae our paper o Jirka on he occaion
More informationarxiv: v1 [cs.cg] 21 Mar 2013
On he rech facor of he Thea-4 graph Lui Barba Proenji Boe Jean-Lou De Carufel André van Renen Sander Verdoncho arxiv:1303.5473v1 [c.cg] 21 Mar 2013 Abrac In hi paper we how ha he θ-graph wih 4 cone ha
More informationThe Residual Graph. 12 Augmenting Path Algorithms. Augmenting Path Algorithm. Augmenting Path Algorithm
Augmening Pah Algorihm Greedy-algorihm: ar wih f (e) = everywhere find an - pah wih f (e) < c(e) on every edge augmen flow along he pah repea a long a poible The Reidual Graph From he graph G = (V, E,
More informationAdmin MAX FLOW APPLICATIONS. Flow graph/networks. Flow constraints 4/30/13. CS lunch today Grading. in-flow = out-flow for every vertex (except s, t)
/0/ dmin lunch oday rading MX LOW PPLIION 0, pring avid Kauchak low graph/nework low nework direced, weighed graph (V, ) poiive edge weigh indicaing he capaciy (generally, aume ineger) conain a ingle ource
More informationGroup C*-algebras A.K. Recall 1 that if G is a nonempty set, the linear space
Group C*-algebra A.K. Recall 1 ha if G i a nonempy e, he linear pace c oo (G) = {f : G C : upp f finie } ha a Hamel bai coniing of he funcion {δ : G} where { 1, = δ () = 0, Thu every f c oo (G) i a finie
More informationCHAPTER 7: UNCERTAINTY
Eenial Microeconomic - ecion 7-3, 7-4 CHPTER 7: UNCERTINTY Fir and econd order ochaic dominance 2 Mean preerving pread 8 Condiional ochaic Dominance 0 Monoone Likelihood Raio Propery 2 Coninuou diribuion
More informationPositive and negative solutions of a boundary value problem for a
Invenion Journl of Reerch Technology in Engineering & Mngemen (IJRTEM) ISSN: 2455-3689 www.ijrem.com Volume 2 Iue 9 ǁ Sepemer 28 ǁ PP 73-83 Poiive nd negive oluion of oundry vlue prolem for frcionl, -difference
More informationThe Residual Graph. 11 Augmenting Path Algorithms. Augmenting Path Algorithm. Augmenting Path Algorithm
Augmening Pah Algorihm Greedy-algorihm: ar wih f (e) = everywhere find an - pah wih f (e) < c(e) on every edge augmen flow along he pah repea a long a poible The Reidual Graph From he graph G = (V, E,
More informationA LOGIC OF ORTHOGONALITY
ARCHIVUM MATHEMATICUM (BRNO) Tomu 42 (2006), 309 334 A LOGIC OF ORTHOGONALITY J. ADÁMEK, M. HÉBERT AND L. SOUSA Thi paper wa inpired by he hard-o-beleive fac ha Jiří Roický i geing ixy. We are happy o
More informationGreedy. I Divide and Conquer. I Dynamic Programming. I Network Flows. Network Flow. I Previous topics: design techniques
Algorihm Deign Technique CS : Nework Flow Dan Sheldon April, reedy Divide and Conquer Dynamic Programming Nework Flow Comparion Nework Flow Previou opic: deign echnique reedy Divide and Conquer Dynamic
More informationBilal Khan Department of Mathematics and Computer Science, John Jay College of Criminal Justice, City University of New York, New York, NY 10019, USA.
INTEGERS: ELECTRONIC JOURNAL OF COMBINATORIAL NUMBER THEORY 7 (2007), #A12 A GRAPHIC GENERALIZATION OF ARITHMETIC Bilal Khan Deparmen of Mahemaic and Compuer Science, John Jay College of Criminal Juice,
More information1 Adjusted Parameters
1 Adjued Parameer Here, we li he exac calculaion we made o arrive a our adjued parameer Thee adjumen are made for each ieraion of he Gibb ampler, for each chain of he MCMC The regional memberhip of each
More informationMore on ODEs by Laplace Transforms October 30, 2017
More on OE b Laplace Tranfor Ocober, 7 More on Ordinar ifferenial Equaion wih Laplace Tranfor Larr areo Mechanical Engineering 5 Seinar in Engineering nali Ocober, 7 Ouline Review la cla efiniion of Laplace
More informationA Guided Tour in the Topos of Graphs
A Guided Tour in he Topo of Graph Sebaiano Vigna Abrac In hi paper we urvey he fundamenal conrucion of a preheaf opo in he cae of he elemenary opo of graph. We prove ha he raniion graph of nondeerminiic
More informationTHE BERNOULLI NUMBERS. t k. = lim. = lim = 1, d t B 1 = lim. 1+e t te t = lim t 0 (e t 1) 2. = lim = 1 2.
THE BERNOULLI NUMBERS The Bernoulli numbers are defined here by he exponenial generaing funcion ( e The firs one is easy o compue: (2 and (3 B 0 lim 0 e lim, 0 e ( d B lim 0 d e +e e lim 0 (e 2 lim 0 2(e
More informationSYNTACTIC COMPLEXITY OF R- AND J-TRIVIAL REGULAR LANGUAGES
International Journal of Foundations of Computer Science Vol. 25, No. 7 (2014) 807 821 c World Scientific Publishing Company DOI: 10.1142/S0129054114400097 SYNTACTIC COMPLEXITY OF R- AND J-TRIVIAL REGULAR
More informationLongest Common Prefixes
Longes Common Prefixes The sandard ordering for srings is he lexicographical order. I is induced by an order over he alphabe. We will use he same symbols (,
More informationPHYSICS Solving Equations
Sepember 20, 2013 PHYSIS Solving Equaion Sepember 2013 www.njcl.org Solving for a Variable Our goal i o be able o olve any equaion for any variable ha appear in i. Le' look a a imple equaion fir. The variable
More informationResearch Article On Double Summability of Double Conjugate Fourier Series
Inernaional Journal of Mahemaic and Mahemaical Science Volume 22, Aricle ID 4592, 5 page doi:.55/22/4592 Reearch Aricle On Double Summabiliy of Double Conjugae Fourier Serie H. K. Nigam and Kuum Sharma
More informationLinking Prefixes and Suffixes for Constraints Encoded Using Automata with Accumulators
Linking Prefixe and Suffixe for Conrain Encoded Uing Auomaa wih Accumulaor Nicola Beldiceanu, Ma Carlon 2, Pierre Flener 3, María Andreína Francico Rodríguez 3, and Juin Pearon 3 TASC eam (CNRS/INRIA),
More informationarxiv: v2 [cs.fl] 6 Mar 2017
SYNTACTIC COMPLEXITY OF BIFIX-FREE LANGUAGES MAREK SZYKU LA arxiv:1604.06936v2 [cs.fl] 6 Mar 2017 Institute of Computer Science, University of Wroc law, Joliot-Curie 15, PL-50-383 Wroc law, Poland JOHN
More informationExponential Sawtooth
ECPE 36 HOMEWORK 3: PROPERTIES OF THE FOURIER TRANSFORM SOLUTION. Exponenial Sawooh: The eaie way o do hi problem i o look a he Fourier ranform of a ingle exponenial funcion, () = exp( )u(). From he able
More informationANSWERS TO ODD NUMBERED EXERCISES IN CHAPTER
John Riley 6 December 200 NWER TO ODD NUMBERED EXERCIE IN CHPTER 7 ecion 7 Exercie 7-: m m uppoe ˆ, m=,, M (a For M = 2, i i eay o how ha I implie I From I, for any probabiliy vecor ( p, p 2, 2 2 ˆ ( p,
More informationStability in Distribution for Backward Uncertain Differential Equation
Sabiliy in Diribuion for Backward Uncerain Differenial Equaion Yuhong Sheng 1, Dan A. Ralecu 2 1. College of Mahemaical and Syem Science, Xinjiang Univeriy, Urumqi 8346, China heng-yh12@mail.inghua.edu.cn
More informationNetwork Flows UPCOPENCOURSEWARE number 34414
Nework Flow UPCOPENCOURSEWARE number Topic : F.-Javier Heredia Thi work i licened under he Creaive Common Aribuion- NonCommercial-NoDeriv. Unpored Licene. To view a copy of hi licene, vii hp://creaivecommon.org/licene/by-nc-nd/./
More informationEE202 Circuit Theory II
EE202 Circui Theory II 2017-2018, Spring Dr. Yılmaz KALKAN I. Inroducion & eview of Fir Order Circui (Chaper 7 of Nilon - 3 Hr. Inroducion, C and L Circui, Naural and Sep epone of Serie and Parallel L/C
More informationChapter 6. Laplace Transforms
Chaper 6. Laplace Tranform Kreyzig by YHLee;45; 6- An ODE i reduced o an algebraic problem by operaional calculu. The equaion i olved by algebraic manipulaion. The reul i ranformed back for he oluion of
More informationSyntactic Complexity of Ideal and Closed Languages
Syntactic Complexity of Ideal and Closed Languages Janusz Brzozowski 1 and Yuli Ye 2 1 David R. Cheriton School of Computer Science, University of Waterloo, Waterloo, ON, Canada N2L 3G1 {brzozo@uwaterloo.ca
More informationPhysics 240: Worksheet 16 Name
Phyic 4: Workhee 16 Nae Non-unifor circular oion Each of hee proble involve non-unifor circular oion wih a conan α. (1) Obain each of he equaion of oion for non-unifor circular oion under a conan acceleraion,
More informationarxiv:math/ v2 [math.fa] 30 Jul 2006
ON GÂTEAUX DIFFERENTIABILITY OF POINTWISE LIPSCHITZ MAPPINGS arxiv:mah/0511565v2 [mah.fa] 30 Jul 2006 JAKUB DUDA Abrac. We prove ha for every funcion f : X Y, where X i a eparable Banach pace and Y i a
More informationANALYSIS OF SOME SAFETY ASSESSMENT STANDARD ON GROUNDING SYSTEMS
ANAYSIS OF SOME SAFETY ASSESSMENT STANDARD ON GROUNDING SYSTEMS Shang iqun, Zhang Yan, Cheng Gang School of Elecrical and Conrol Engineering, Xi an Univeriy of Science & Technology, 710054, Xi an, China,
More information16 Max-Flow Algorithms and Applications
Algorihm A proce canno be underood by opping i. Underanding mu move wih he flow of he proce, mu join i and flow wih i. The Fir Law of Mena, in Frank Herber Dune (196) There a difference beween knowing
More informationCONTROL SYSTEMS. Chapter 10 : State Space Response
CONTROL SYSTEMS Chaper : Sae Space Repone GATE Objecive & Numerical Type Soluion Queion 5 [GATE EE 99 IIT-Bombay : Mark] Conider a econd order yem whoe ae pace repreenaion i of he form A Bu. If () (),
More informationWhen analyzing an object s motion there are two factors to consider when attempting to bring it to rest. 1. The object s mass 2. The object s velocity
SPH4U Momenum LoRuo Momenum i an exenion of Newon nd law. When analyzing an ojec moion here are wo facor o conider when aeming o ring i o re.. The ojec ma. The ojec velociy The greaer an ojec ma, he more
More informationKEY. Math 334 Midterm I Fall 2008 sections 001 and 003 Instructor: Scott Glasgow
1 KEY Mah 4 Miderm I Fall 8 secions 1 and Insrucor: Sco Glasgow Please do NOT wrie on his eam. No credi will be given for such work. Raher wrie in a blue book, or on our own paper, preferabl engineering
More informationEnergy Equality and Uniqueness of Weak Solutions to MHD Equations in L (0,T; L n (Ω))
Aca Mahemaica Sinica, Englih Serie May, 29, Vol. 25, No. 5, pp. 83 814 Publihed online: April 25, 29 DOI: 1.17/1114-9-7214-8 Hp://www.AcaMah.com Aca Mahemaica Sinica, Englih Serie The Ediorial Office of
More informationMatching. Slides designed by Kevin Wayne.
Maching Maching. Inpu: undireced graph G = (V, E). M E i a maching if each node appear in a mo edge in M. Max maching: find a max cardinaliy maching. Slide deigned by Kevin Wayne. Biparie Maching Biparie
More information23.5. Half-Range Series. Introduction. Prerequisites. Learning Outcomes
Half-Range Series 2.5 Inroducion In his Secion we address he following problem: Can we find a Fourier series expansion of a funcion defined over a finie inerval? Of course we recognise ha such a funcion
More information5.2 GRAPHICAL VELOCITY ANALYSIS Polygon Method
ME 352 GRHICL VELCITY NLYSIS 52 GRHICL VELCITY NLYSIS olygon Mehod Velociy analyi form he hear of kinemaic and dynamic of mechanical yem Velociy analyi i uually performed following a poiion analyi; ie,
More informationA NOTE ON PRE-J-GROUP RINGS
Qaar Univ. Sci. J. (1991), 11: 27-31 A NOTE ON PRE-J-GROUP RINGS By W. B. VASANTHA Deparmen of Mahemaic, Indian Iniue of Technology Madra - 600 036, India. ABSTRACT Given an aociaive ring R aifying amb
More informationSome Ramsey results for the n-cube
Some Ramsey resuls for he n-cube Ron Graham Universiy of California, San Diego Jozsef Solymosi Universiy of Briish Columbia, Vancouver, Canada Absrac In his noe we esablish a Ramsey-ype resul for cerain
More informationON FRACTIONAL ORNSTEIN-UHLENBECK PROCESSES
Communicaion on Sochaic Analyi Vol. 5, No. 1 211 121-133 Serial Publicaion www.erialpublicaion.com ON FRACTIONAL ORNSTEIN-UHLENBECK PROCESSES TERHI KAARAKKA AND PAAVO SALMINEN Abrac. In hi paper we udy
More informationAn introduction to the (local) martingale problem
An inroducion o he (local) maringale problem Chri Janjigian Ocober 14, 214 Abrac Thee are my preenaion noe for a alk in he Univeriy of Wiconin - Madion graduae probabiliy eminar. Thee noe are primarily
More informationDiscussion Session 2 Constant Acceleration/Relative Motion Week 03
PHYS 100 Dicuion Seion Conan Acceleraion/Relaive Moion Week 03 The Plan Today you will work wih your group explore he idea of reference frame (i.e. relaive moion) and moion wih conan acceleraion. You ll
More informationLie Derivatives operator vector field flow push back Lie derivative of
Lie Derivaives The Lie derivaive is a mehod of compuing he direcional derivaive of a vecor field wih respec o anoher vecor field We already know how o make sense of a direcional derivaive of real valued
More information13.1 Circuit Elements in the s Domain Circuit Analysis in the s Domain The Transfer Function and Natural Response 13.
Chaper 3 The Laplace Tranform in Circui Analyi 3. Circui Elemen in he Domain 3.-3 Circui Analyi in he Domain 3.4-5 The Tranfer Funcion and Naural Repone 3.6 The Tranfer Funcion and he Convoluion Inegral
More informationReminder: Flow Networks
0/0/204 Ma/CS 6a Cla 4: Variou (Flow) Execie Reminder: Flow Nework A flow nework i a digraph G = V, E, ogeher wih a ource verex V, a ink verex V, and a capaciy funcion c: E N. Capaciy Source 7 a b c d
More informationTo become more mathematically correct, Circuit equations are Algebraic Differential equations. from KVL, KCL from the constitutive relationship
Laplace Tranform (Lin & DeCarlo: Ch 3) ENSC30 Elecric Circui II The Laplace ranform i an inegral ranformaion. I ranform: f ( ) F( ) ime variable complex variable From Euler > Lagrange > Laplace. Hence,
More information5.1 - Logarithms and Their Properties
Chaper 5 Logarihmic Funcions 5.1 - Logarihms and Their Properies Suppose ha a populaion grows according o he formula P 10, where P is he colony size a ime, in hours. When will he populaion be 2500? We
More informationChapter 6. Laplace Transforms
6- Chaper 6. Laplace Tranform 6.4 Shor Impule. Dirac Dela Funcion. Parial Fracion 6.5 Convoluion. Inegral Equaion 6.6 Differeniaion and Inegraion of Tranform 6.7 Syem of ODE 6.4 Shor Impule. Dirac Dela
More informationStationary Distribution. Design and Analysis of Algorithms Andrei Bulatov
Saionary Disribuion Design and Analysis of Algorihms Andrei Bulaov Algorihms Markov Chains 34-2 Classificaion of Saes k By P we denoe he (i,j)-enry of i, j Sae is accessible from sae if 0 for some k 0
More information23.2. Representing Periodic Functions by Fourier Series. Introduction. Prerequisites. Learning Outcomes
Represening Periodic Funcions by Fourier Series 3. Inroducion In his Secion we show how a periodic funcion can be expressed as a series of sines and cosines. We begin by obaining some sandard inegrals
More informationResearch Article Existence and Uniqueness of Solutions for a Class of Nonlinear Stochastic Differential Equations
Hindawi Publihing Corporaion Abrac and Applied Analyi Volume 03, Aricle ID 56809, 7 page hp://dx.doi.org/0.55/03/56809 Reearch Aricle Exience and Uniquene of Soluion for a Cla of Nonlinear Sochaic Differenial
More informationTraversal of a subtree is slow, which affects prefix and range queries.
Compac Tries Tries suffer from a large number nodes, Ω( R ) in he wors case. The space requiremen is large, since each node needs much more space han a single symbol. Traversal of a subree is slow, which
More informationStochastic Optimal Control in Infinite Dimensions: Dynamic Programming and HJB Equations
Sochaic Opimal Conrol in Infinie Dimenion: Dynamic Programming and HJB Equaion G. Fabbri 1 F. Gozzi 2 and A. Świe ch3 wih Chaper 6 by M. Fuhrman 4 and G. Teiore 5 1 Aix-Mareille Univeriy (Aix-Mareille
More information