Dynamic Fully-Compressed Suffix Trees
|
|
- Shanon Rogers
- 6 years ago
- Views:
Transcription
1 Motivtion Dynmic FCST s Conclusions Dynmic Fully-Compressed Suffix Trees Luís M. S. Russo Gonzlo Nvrro Arlindo L. Oliveir INESC-ID/IST {lsr,ml}@lgos.inesc-id.pt Dept. of Computer Science, University of Chile gnvrro@dcc.uchile.cl 19th Annul Symposium on Comintoril Pttern Mtching Luís M. S. Russo, Gonzlo Nvrro, Arlindo L. Oliveir Dynmic Fully-Compressed Suffix Trees
2 Motivtion Dynmic FCST s Conclusions Outline 1 Motivtion The Prolem We Studied Previous Work nd FCST s Fully-Compressed Suffix Tree Bsics 2 Dynmic FCST s The prolem Dynmic CSA s Updting the smpling 3 Conclusions Summry Luís M. S. Russo, Gonzlo Nvrro, Arlindo L. Oliveir Dynmic Fully-Compressed Suffix Trees
3 Motivtion Dynmic FCST s Conclusions The Prolem Previous nd FCST s FCST sics Suffix Trees re Importnt 28 min Suffix trees re importnt for severl string prolems: pttern mtching longest common sustring super mximl repets ioinformtics pplictions etc Luís M. S. Russo, Gonzlo Nvrro, Arlindo L. Oliveir Dynmic Fully-Compressed Suffix Trees
4 Motivtion Dynmic FCST s Conclusions The Prolem Previous nd FCST s FCST sics Suffix Trees re Importnt 27 min Exmple (Suffix Tree for ) A: Luís M. S. Russo, Gonzlo Nvrro, Arlindo L. Oliveir Dynmic Fully-Compressed Suffix Trees
5 Motivtion Dynmic FCST s Conclusions The Prolem Previous nd FCST s FCST sics Representtion Prolems 26 min Prolem (Suffix Trees need too much spce) Pointer sed representtions require O(n log n) its. This is much lrger thn the indexed string. Stte of the rt implementtions require [8, 10]n log σ its. Luís M. S. Russo, Gonzlo Nvrro, Arlindo L. Oliveir Dynmic Fully-Compressed Suffix Trees
6 Motivtion Dynmic FCST s Conclusions The Prolem Previous nd FCST s FCST sics Compressed Representtions 25 min Sdkne proposed wy to represent compressed suffix trees, in nh k + 6n + o(n log σ) its. Compressed Suffix Tree Tree Structure + Compressed Index Blnced prentheses representtion Nodes represented s intervls Luís M. S. Russo, Gonzlo Nvrro, Arlindo L. Oliveir Dynmic Fully-Compressed Suffix Trees
7 Motivtion Dynmic FCST s Conclusions The Prolem Previous nd FCST s FCST sics Compressed Representtions 25 min A dynmic representtion, y Chn et l., requires nh k + Θ(n) + o(n log σ) its nd suffers n O(log n) slowdown. Compressed Suffix Tree Tree Structure + Compressed Index Blnced prentheses representtion Nodes represented s intervls Luís M. S. Russo, Gonzlo Nvrro, Arlindo L. Oliveir Dynmic Fully-Compressed Suffix Trees
8 Motivtion Dynmic FCST s Conclusions The Prolem Previous nd FCST s FCST sics Compressed Representtions 25 min The Fully-Compressed suffix tree representtion requires only nh k + o(n log σ) its. The representtion uses the following scheme: Fully-Compressed Suffix Tree Tree Structure + Compressed Index Smpling LSA Nodes represented s intervls Luís M. S. Russo, Gonzlo Nvrro, Arlindo L. Oliveir Dynmic Fully-Compressed Suffix Trees
9 Motivtion Dynmic FCST s Conclusions The Prolem Previous nd FCST s FCST sics Compressed Representtions 25 min We present dynmic FCST s tht require only nh k + o(n log σ) its with O(log n) slowdown. Fully-Compressed Suffix Tree Tree Structure + Compressed Index Smpling LSA Nodes represented s intervls Luís M. S. Russo, Gonzlo Nvrro, Arlindo L. Oliveir Dynmic Fully-Compressed Suffix Trees
10 Motivtion Dynmic FCST s Conclusions The Prolem Previous nd FCST s FCST sics Node Representtion 23 min A node represented s n intervl of leves of suffix tree. Exmple Intervl [3, 6] represents node A: Luís M. S. Russo, Gonzlo Nvrro, Arlindo L. Oliveir Dynmic Fully-Compressed Suffix Trees
11 Motivtion Dynmic FCST s Conclusions The Prolem Previous nd FCST s FCST sics Compressed Indexes 22 min Compressed indexes re compressed representtions of the leves of suffix tree. Their success relies on: Succinct structures, sed on RANK nd SELECT. Dt compression, tht represent T in O(uH k ) its. Exmples FM-index, Compressed Suffix Arrys, LZ-index, etc. Sdkne used compressed suffix rrys. We need compressed index tht supports ψ nd LF. For exmple the Alphet-Friendly FM-Index. Luís M. S. Russo, Gonzlo Nvrro, Arlindo L. Oliveir Dynmic Fully-Compressed Suffix Trees
12 Motivtion Dynmic FCST s Conclusions The Prolem Previous nd FCST s FCST sics Suffix Tree self-similrity LCA nd SLINK 21 min Lemm When LCA(v, v ) ROOT we hve tht: SLINK(LCA(v, v )) = LCA(SLINK(v), SLINK(v )) α X α Y v Z v Y Z ψ ψ This self-similrity explins why we cn store only some nodes. Luís M. S. Russo, Gonzlo Nvrro, Arlindo L. Oliveir Dynmic Fully-Compressed Suffix Trees
13 Motivtion Dynmic FCST s Conclusions The Prolem Previous nd FCST s FCST sics Smpling 18 min FCST s use smpling such tht in ny sequence v SLINK(v) SLINK(SLINK(v)) SLINK(SLINK(SLINK(v)))... of size δ there is t lest one smpled node. Luís M. S. Russo, Gonzlo Nvrro, Arlindo L. Oliveir Dynmic Fully-Compressed Suffix Trees
14 Motivtion Dynmic FCST s Conclusions The Prolem Previous nd FCST s FCST sics Fundmentl lemm 17 min Lemm If SLINK r (LCA(v, v )) = ROOT, nd let d = min(δ, r + 1). Then SDEP(LCA(v, v )) = mx 0 i<d {i + SDEP(LCSA(SLINK i (v), SLINK i (v )))} Proof. SDEP(LCA(v, v )) = i + SDEP(SLINK i (LCA(v, v ))) = i + SDEP(LCA(SLINK i (v), SLINK i (v ))) i + SDEP(LCSA(SLINK i (v), SLINK i (v ))) The lst inequlity is n equlity for some i d. Luís M. S. Russo, Gonzlo Nvrro, Arlindo L. Oliveir Dynmic Fully-Compressed Suffix Trees
15 Motivtion Dynmic FCST s Conclusions The Prolem Previous nd FCST s FCST sics Fundmentl lemm 17 min Lemm If SLINK r (LCA(v, v )) = ROOT, nd let d = min(δ, r + 1). Then SDEP(LCA(v, v )) = mx 0 i<d {i + SDEP(LCSA(SLINK i (v), SLINK i (v )))} Proof. SDEP(LCA(v, v )) = i + SDEP(SLINK i (LCA(v, v ))) = i + SDEP(LCA(SLINK i (v), SLINK i (v ))) i + SDEP(LCSA(SLINK i (v), SLINK i (v ))) The lst inequlity is n equlity for some i d. Luís M. S. Russo, Gonzlo Nvrro, Arlindo L. Oliveir Dynmic Fully-Compressed Suffix Trees
16 Motivtion Dynmic FCST s Conclusions The Prolem Previous nd FCST s FCST sics Fundmentl lemm 17 min Lemm If SLINK r (LCA(v, v )) = ROOT, nd let d = min(δ, r + 1). Then SDEP(LCA(v, v ))? mx 0 i<d {i + SDEP(LCSA(SLINK i (v), SLINK i (v )))} Proof. SDEP(LCA(v, v )) = i + SDEP(SLINK i (LCA(v, v ))) = i + SDEP(LCA(SLINK i (v), SLINK i (v ))) i + SDEP(LCSA(SLINK i (v), SLINK i (v ))) The lst inequlity is n equlity for some i d. Luís M. S. Russo, Gonzlo Nvrro, Arlindo L. Oliveir Dynmic Fully-Compressed Suffix Trees
17 Motivtion Dynmic FCST s Conclusions The Prolem Previous nd FCST s FCST sics Fundmentl lemm 17 min Lemm If SLINK r (LCA(v, v )) = ROOT, nd let d = min(δ, r + 1). Then SDEP(LCA(v, v ))? mx 0 i<d {i + SDEP(LCSA(SLINK i (v), SLINK i (v )))} Proof. SDEP(LCA(v, v )) = i + SDEP(SLINK i (LCA(v, v ))) = i + SDEP(LCA(SLINK i (v), SLINK i (v ))) i + SDEP(LCSA(SLINK i (v), SLINK i (v ))) The lst inequlity is n equlity for some i d. Luís M. S. Russo, Gonzlo Nvrro, Arlindo L. Oliveir Dynmic Fully-Compressed Suffix Trees
18 Motivtion Dynmic FCST s Conclusions The Prolem Previous nd FCST s FCST sics Fundmentl lemm 17 min Lemm If SLINK r (LCA(v, v )) = ROOT, nd let d = min(δ, r + 1). Then SDEP(LCA(v, v )) mx 0 i<d {i + SDEP(LCSA(SLINK i (v), SLINK i (v )))} Proof. SDEP(LCA(v, v )) = i + SDEP(SLINK i (LCA(v, v ))) = i + SDEP(LCA(SLINK i (v), SLINK i (v ))) i + SDEP(LCSA(SLINK i (v), SLINK i (v ))) The lst inequlity is n equlity for some i d. Luís M. S. Russo, Gonzlo Nvrro, Arlindo L. Oliveir Dynmic Fully-Compressed Suffix Trees
19 Motivtion Dynmic FCST s Conclusions The Prolem Previous nd FCST s FCST sics Fundmentl lemm 17 min Lemm If SLINK r (LCA(v, v )) = ROOT, nd let d = min(δ, r + 1). Then SDEP(LCA(v, v )) = mx 0 i<d {i + SDEP(LCSA(SLINK i (v), SLINK i (v )))} Proof. SDEP(LCA(v, v )) = i + SDEP(SLINK i (LCA(v, v ))) = i + SDEP(LCA(SLINK i (v), SLINK i (v ))) i + SDEP(LCSA(SLINK i (v), SLINK i (v ))) The lst inequlity is n equlity for some i d. Luís M. S. Russo, Gonzlo Nvrro, Arlindo L. Oliveir Dynmic Fully-Compressed Suffix Trees
20 Motivtion Dynmic FCST s Conclusions The Prolem Previous nd FCST s FCST sics Kernel Opertions 12 min With the previous lemm FCST s compute the following opertions: SDEP(v) = SDEP(LCA(v, v)) = mx 0 i<d {i + SDEP(LCSA(ψ i (v l ), ψ i (v r )))}. LCA(v, v ) = LF(v[0..i 1], LCSA(ψ i (min{v l, v l }), ψi (mx{v r, v r }))), for the i in the lemm. SLINK(v) = LCA(ψ(v l ), ψ(v r )) Luís M. S. Russo, Gonzlo Nvrro, Arlindo L. Oliveir Dynmic Fully-Compressed Suffix Trees
21 Motivtion Dynmic FCST s Conclusions The prolem Dynmic CSA Updting the smpling Dynmic FCST s 11 min Prolem (FCST s re sttic) How to insert or remove text T from FCST tht is indexing collection C of texts? Use Weiner s lgorithm or delete suffixes from the lrgest to the iggest. Updte the CSA nd the smpling. Luís M. S. Russo, Gonzlo Nvrro, Arlindo L. Oliveir Dynmic Fully-Compressed Suffix Trees
22 Motivtion Dynmic FCST s Conclusions The prolem Dynmic CSA Updting the smpling Dynmic FCST s 11 min Prolem (FCST s re sttic) How to insert or remove text T from FCST tht is indexing collection C of texts? Use Weiner s lgorithm or delete suffixes from the lrgest to the iggest. Updte the CSA nd the smpling. Luís M. S. Russo, Gonzlo Nvrro, Arlindo L. Oliveir Dynmic Fully-Compressed Suffix Trees
23 Motivtion Dynmic FCST s Conclusions The prolem Dynmic CSA Updting the smpling Dynmic FCST s 11 min Prolem (FCST s re sttic) How to insert or remove text T from FCST tht is indexing collection C of texts? Use Weiner s lgorithm or delete suffixes from the lrgest to the iggest. Updte the CSA nd the smpling. Luís M. S. Russo, Gonzlo Nvrro, Arlindo L. Oliveir Dynmic Fully-Compressed Suffix Trees
24 Motivtion Dynmic FCST s Conclusions The prolem Dynmic CSA Updting the smpling Dynmic FCST s 10 min Use dynmic CSA s. Theorem (Mäkinen, Nvrro) A dynmic CSA over collection C cn e stored in nh k (C) + o(n log σ) its, with times t = Ψ = O(((log σ log n) 1 + 1) log n), Φ = O((log σ log n) log 2 n), nd inserting/deleting texts T in O( T (t + Ψ)). Lets tke closer look t the smpling. Luís M. S. Russo, Gonzlo Nvrro, Arlindo L. Oliveir Dynmic Fully-Compressed Suffix Trees
25 Motivtion Dynmic FCST s Conclusions The prolem Dynmic CSA Updting the smpling Dynmic FCST s 10 min Use dynmic CSA s. Theorem (Mäkinen, Nvrro) A dynmic CSA over collection C cn e stored in nh k (C) + o(n log σ) its, with times t = Ψ = O(((log σ log n) 1 + 1) log n), Φ = O((log σ log n) log 2 n), nd inserting/deleting texts T in O( T (t + Ψ)). Lets tke closer look t the smpling. Luís M. S. Russo, Gonzlo Nvrro, Arlindo L. Oliveir Dynmic Fully-Compressed Suffix Trees
26 Motivtion Dynmic FCST s Conclusions The prolem Dynmic CSA Updting the smpling Reverse tree 9 min How do we gurntee the smpling condition, with t most O(n/δ) nodes? We use purely conceptul reverse tree. Definition The reverse tree T R is the miniml leled tree tht, for every node v of suffix tree, contins node v R denoting the reverse string of the pth-lel of v. Luís M. S. Russo, Gonzlo Nvrro, Arlindo L. Oliveir Dynmic Fully-Compressed Suffix Trees
27 Motivtion Dynmic FCST s Conclusions The prolem Dynmic CSA Updting the smpling Reverse tree 9 min How do we gurntee the smpling condition, with t most O(n/δ) nodes? We use purely conceptul reverse tree. Definition The reverse tree T R is the miniml leled tree tht, for every node v of suffix tree, contins node v R denoting the reverse string of the pth-lel of v. Luís M. S. Russo, Gonzlo Nvrro, Arlindo L. Oliveir Dynmic Fully-Compressed Suffix Trees
28 Motivtion Dynmic FCST s Conclusions The prolem Dynmic CSA Updting the smpling Reverse tree 9 min How do we gurntee the smpling condition, with t most O(n/δ) nodes? We use purely conceptul reverse tree. Definition The reverse tree T R is the miniml leled tree tht, for every node v of suffix tree, contins node v R denoting the reverse string of the pth-lel of v. Luís M. S. Russo, Gonzlo Nvrro, Arlindo L. Oliveir Dynmic Fully-Compressed Suffix Trees
29 Motivtion Dynmic FCST s Conclusions The prolem Dynmic CSA Updting the smpling Reverse tree 8 min Exmple (Suffix Tree for nd its reverse tree) Luís M. S. Russo, Gonzlo Nvrro, Arlindo L. Oliveir Dynmic Fully-Compressed Suffix Trees
30 Motivtion Dynmic FCST s Conclusions The prolem Dynmic CSA Updting the smpling Reverse tree 8 min Exmple (Suffix Tree for nd its reverse tree) Note tht the SLINK s correspond to moving upwrds on the reverse tree. Luís M. S. Russo, Gonzlo Nvrro, Arlindo L. Oliveir Dynmic Fully-Compressed Suffix Trees
31 Motivtion Dynmic FCST s Conclusions The prolem Dynmic CSA Updting the smpling Reverse tree 8 min Exmple (Suffix Tree for nd its reverse tree) We smple the nodes for which TDEP(v R ) δ/2 0 nd HEIGHT(v R ) δ/2. Luís M. S. Russo, Gonzlo Nvrro, Arlindo L. Oliveir Dynmic Fully-Compressed Suffix Trees
32 Motivtion Dynmic FCST s Conclusions The prolem Dynmic CSA Updting the smpling Reverse tree 8 min Exmple (Suffix Tree for nd its reverse tree) Wht hppens when nodes re inserted or deleted? Luís M. S. Russo, Gonzlo Nvrro, Arlindo L. Oliveir Dynmic Fully-Compressed Suffix Trees
33 Motivtion Dynmic FCST s Conclusions The prolem Dynmic CSA Updting the smpling Reverse tree 8 min Exmple (Suffix Tree for nd its reverse tree) Only the leves of the reverse tree chnge. Luís M. S. Russo, Gonzlo Nvrro, Arlindo L. Oliveir Dynmic Fully-Compressed Suffix Trees
34 Motivtion Dynmic FCST s Conclusions The prolem Dynmic CSA Updting the smpling Reverse tree 8 min Exmple (Suffix Tree for nd its reverse tree) This smpling does not respect the HEIGHT(v R ) δ/2 condition. Luís M. S. Russo, Gonzlo Nvrro, Arlindo L. Oliveir Dynmic Fully-Compressed Suffix Trees
35 Motivtion Dynmic FCST s Conclusions The prolem Dynmic CSA Updting the smpling Reverse tree 8 min Exmple (Suffix Tree for nd its reverse tree) To insert node we do n upwrds scn nd smple nodes if necessry. Luís M. S. Russo, Gonzlo Nvrro, Arlindo L. Oliveir Dynmic Fully-Compressed Suffix Trees
36 Motivtion Dynmic FCST s Conclusions The prolem Dynmic CSA Updting the smpling Reverse tree 8 min Exmple (Suffix Tree for nd its reverse tree) To insert node we do n upwrds scn nd smple nodes if necessry. Luís M. S. Russo, Gonzlo Nvrro, Arlindo L. Oliveir Dynmic Fully-Compressed Suffix Trees
37 Motivtion Dynmic FCST s Conclusions The prolem Dynmic CSA Updting the smpling Reverse tree 8 min Exmple (Suffix Tree for nd its reverse tree) To insert node we do n upwrds scn nd smple nodes if necessry. Luís M. S. Russo, Gonzlo Nvrro, Arlindo L. Oliveir Dynmic Fully-Compressed Suffix Trees
38 Motivtion Dynmic FCST s Conclusions The prolem Dynmic CSA Updting the smpling Reverse tree 8 min Exmple (Suffix Tree for nd its reverse tree) To delete node we keep reference counters to gurntee tht it is sfe to unsmple node. Luís M. S. Russo, Gonzlo Nvrro, Arlindo L. Oliveir Dynmic Fully-Compressed Suffix Trees
39 Motivtion Dynmic FCST s Conclusions The prolem Dynmic CSA Updting the smpling Reverse tree 8 min Exmple (Suffix Tree for nd its reverse tree) To delete node we keep reference counters to gurntee tht it is sfe to unsmple node. Luís M. S. Russo, Gonzlo Nvrro, Arlindo L. Oliveir Dynmic Fully-Compressed Suffix Trees
40 Motivtion Dynmic FCST s Conclusions The prolem Dynmic CSA Updting the smpling Other contriutions 2 min We study the prolem of chnging logn. We give new wy to compute LSA. We otin generlized rnching, tht determines v 1.v 2 for nodes v 1 nd v 2 nd cn e computed directly over CSA s in the smple time s regulr rnching. Luís M. S. Russo, Gonzlo Nvrro, Arlindo L. Oliveir Dynmic Fully-Compressed Suffix Trees
41 Motivtion Dynmic FCST s Conclusions The prolem Dynmic CSA Updting the smpling Other contriutions 2 min We study the prolem of chnging logn. We give new wy to compute LSA. We otin generlized rnching, tht determines v 1.v 2 for nodes v 1 nd v 2 nd cn e computed directly over CSA s in the smple time s regulr rnching. Luís M. S. Russo, Gonzlo Nvrro, Arlindo L. Oliveir Dynmic Fully-Compressed Suffix Trees
42 Motivtion Dynmic FCST s Conclusions The prolem Dynmic CSA Updting the smpling Other contriutions 2 min We study the prolem of chnging logn. We give new wy to compute LSA. We otin generlized rnching, tht determines v 1.v 2 for nodes v 1 nd v 2 nd cn e computed directly over CSA s in the smple time s regulr rnching. Luís M. S. Russo, Gonzlo Nvrro, Arlindo L. Oliveir Dynmic Fully-Compressed Suffix Trees
43 Motivtion Dynmic FCST s Conclusions Summry Summry 1 min We presented dynmic fully-compressed suffix trees tht: occupy uh k + o(u log σ) its. supports usul opertions in resonle time. Luís M. S. Russo, Gonzlo Nvrro, Arlindo L. Oliveir Dynmic Fully-Compressed Suffix Trees
44 Motivtion Dynmic FCST s Conclusions Summry Acknowledgments 0 min Veli Mäkinen nd Johnnes Fisher for pointing out the generlized rnching prolem. FCT grnt SFRH/BPD/34373/2006 nd project ARN, PTDC/EIA/67722/2006. Millennium Institute for Cell Dynmics nd Biotechnology, Grnt ICM P F, Midepln, Chile. Luís M. S. Russo, Gonzlo Nvrro, Arlindo L. Oliveir Dynmic Fully-Compressed Suffix Trees
45 Motivtion Dynmic FCST s Conclusions Summry Acknowledgments 0 min Thnks for listening. Luís M. S. Russo, Gonzlo Nvrro, Arlindo L. Oliveir Dynmic Fully-Compressed Suffix Trees
Fast Fully-Compressed Suffix Trees
Fast Fully-Compressed Suffix Trees Gonzalo Navarro Department of Computer Science University of Chile, Chile gnavarro@dcc.uchile.cl Luís M. S. Russo INESC-ID / Instituto Superior Técnico Technical University
More informationOn Suffix Tree Breadth
On Suffix Tree Bredth Golnz Bdkoeh 1,, Juh Kärkkäinen 2, Simon J. Puglisi 2,, nd Bell Zhukov 2, 1 Deprtment of Computer Science University of Wrwick Conventry, United Kingdom g.dkoeh@wrwick.c.uk 2 Helsinki
More informationFirst Midterm Examination
24-25 Fll Semester First Midterm Exmintion ) Give the stte digrm of DFA tht recognizes the lnguge A over lphet Σ = {, } where A = {w w contins or } 2) The following DFA recognizes the lnguge B over lphet
More informationFully-Compressed Suffix Trees
Fully-Compressed Suffix Trees Luís M. S. Russo 1, Gonzalo Navarro, and Arlindo L. Oliveira 1 1 INESC-ID, R. Alves Redol 9, 1000 LISBOA, PORTUGAL {lsr,aml}@algos.inesc-id.pt Dept. of Computer Science, University
More informationBalanced binary search trees
02110 Inge Li Gørtz Overview Blnced binry serch trees: Red-blck trees nd 2-3-4 trees Amortized nlysis Dynmic progrmming Network flows String mtching String indexing Computtionl geometry Introduction to
More informationWeek 10: Line Integrals
Week 10: Line Integrls Introduction In this finl week we return to prmetrised curves nd consider integrtion long such curves. We lredy sw this in Week 2 when we integrted long curve to find its length.
More informationLexical Analysis Finite Automate
Lexicl Anlysis Finite Automte CMPSC 470 Lecture 04 Topics: Deterministic Finite Automt (DFA) Nondeterministic Finite Automt (NFA) Regulr Expression NFA DFA A. Finite Automt (FA) FA re grph, like trnsition
More informationThe Regulated and Riemann Integrals
Chpter 1 The Regulted nd Riemnn Integrls 1.1 Introduction We will consider severl different pproches to defining the definite integrl f(x) dx of function f(x). These definitions will ll ssign the sme vlue
More informationp-adic Egyptian Fractions
p-adic Egyptin Frctions Contents 1 Introduction 1 2 Trditionl Egyptin Frctions nd Greedy Algorithm 2 3 Set-up 3 4 p-greedy Algorithm 5 5 p-egyptin Trditionl 10 6 Conclusion 1 Introduction An Egyptin frction
More informationCSCI 340: Computational Models. Transition Graphs. Department of Computer Science
CSCI 340: Computtionl Models Trnsition Grphs Chpter 6 Deprtment of Computer Science Relxing Restrints on Inputs We cn uild n FA tht ccepts only the word! 5 sttes ecuse n FA cn only process one letter t
More informationModule 9: Tries and String Matching
Module 9: Tries nd String Mtching CS 240 - Dt Structures nd Dt Mngement Sjed Hque Veronik Irvine Tylor Smith Bsed on lecture notes by mny previous cs240 instructors Dvid R. Cheriton School of Computer
More informationModule 9: Tries and String Matching
Module 9: Tries nd String Mtching CS 240 - Dt Structures nd Dt Mngement Sjed Hque Veronik Irvine Tylor Smith Bsed on lecture notes by mny previous cs240 instructors Dvid R. Cheriton School of Computer
More informationHarvard University Computer Science 121 Midterm October 23, 2012
Hrvrd University Computer Science 121 Midterm Octoer 23, 2012 This is closed-ook exmintion. You my use ny result from lecture, Sipser, prolem sets, or section, s long s you quote it clerly. The lphet is
More informationChapter 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 informationCS 275 Automata and Formal Language Theory
CS 275 utomt nd Forml Lnguge Theory Course Notes Prt II: The Recognition Prolem (II) Chpter II.5.: Properties of Context Free Grmmrs (14) nton Setzer (Bsed on ook drft y J. V. Tucker nd K. Stephenson)
More informationUninformed Search Lecture 4
Lecture 4 Wht re common serch strtegies tht operte given only serch problem? How do they compre? 1 Agend A quick refresher DFS, BFS, ID-DFS, UCS Unifiction! 2 Serch Problem Formlism Defined vi the following
More informationRegular 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 informationConnected-components. Summary of lecture 9. Algorithms and Data Structures Disjoint sets. Example: connected components in graphs
Prm University, Mth. Deprtment Summry of lecture 9 Algorithms nd Dt Structures Disjoint sets Summry of this lecture: (CLR.1-3) Dt Structures for Disjoint sets: Union opertion Find opertion Mrco Pellegrini
More informationCMSC 330: Organization of Programming Languages
CMSC 330: Orgniztion of Progrmming Lnguges Finite Automt 2 CMSC 330 1 Types of Finite Automt Deterministic Finite Automt (DFA) Exctly one sequence of steps for ech string All exmples so fr Nondeterministic
More informationDATA Search I 魏忠钰. 复旦大学大数据学院 School of Data Science, Fudan University. March 7 th, 2018
DATA620006 魏忠钰 Serch I Mrch 7 th, 2018 Outline Serch Problems Uninformed Serch Depth-First Serch Bredth-First Serch Uniform-Cost Serch Rel world tsk - Pc-mn Serch problems A serch problem consists of:
More informationCS103B Handout 18 Winter 2007 February 28, 2007 Finite Automata
CS103B ndout 18 Winter 2007 Ferury 28, 2007 Finite Automt Initil text y Mggie Johnson. Introduction Severl childrens gmes fit the following description: Pieces re set up on plying ord; dice re thrown or
More information1. For each of the following theorems, give a two or three sentence sketch of how the proof goes or why it is not true.
York University CSE 2 Unit 3. DFA Clsses Converting etween DFA, NFA, Regulr Expressions, nd Extended Regulr Expressions Instructor: Jeff Edmonds Don t chet y looking t these nswers premturely.. For ech
More informationTypes 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 informationIntermediate Math Circles Wednesday, November 14, 2018 Finite Automata II. Nickolas Rollick a b b. a b 4
Intermedite Mth Circles Wednesdy, Novemer 14, 2018 Finite Automt II Nickols Rollick nrollick@uwterloo.c Regulr Lnguges Lst time, we were introduced to the ide of DFA (deterministic finite utomton), one
More information19 Optimal behavior: Game theory
Intro. to Artificil Intelligence: Dle Schuurmns, Relu Ptrscu 1 19 Optiml behvior: Gme theory Adversril stte dynmics hve to ccount for worst cse Compute policy π : S A tht mximizes minimum rewrd Let S (,
More informationTypes 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 informationWhere did dynamic programming come from?
Where did dynmic progrmming come from? String lgorithms Dvid Kuchk cs302 Spring 2012 Richrd ellmn On the irth of Dynmic Progrmming Sturt Dreyfus http://www.eng.tu.c.il/~mi/cd/ or50/1526-5463-2002-50-01-0048.pdf
More informationSuccinct Text Indexes on Large Alphabet
Succinct Text Indexes on Lrge Alphet Meng Zhng 1, Jijun Tng 2, Dong Guo 1, Ling Hu 1, nd Qing Li 1 1 College of Computer Science nd Technology, Jilin University, Chngchun 130012, Chin zm@mil.edu.cn, {guodg,
More informationTheoretical foundations of Gaussian quadrature
Theoreticl foundtions of Gussin qudrture 1 Inner product vector spce Definition 1. A vector spce (or liner spce) is set V = {u, v, w,...} in which the following two opertions re defined: (A) Addition of
More informationCS 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 informationGrammar. 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 information1.4 Nonregular Languages
74 1.4 Nonregulr Lnguges The number of forml lnguges over ny lphbet (= decision/recognition problems) is uncountble On the other hnd, the number of regulr expressions (= strings) is countble Hence, ll
More informationCS 188: Artificial Intelligence Spring 2007
CS 188: Artificil Intelligence Spring 2007 Lecture 3: Queue-Bsed Serch 1/23/2007 Srini Nrynn UC Berkeley Mny slides over the course dpted from Dn Klein, Sturt Russell or Andrew Moore Announcements Assignment
More informationDesigning finite automata II
Designing finite utomt II Prolem: Design DFA A such tht L(A) consists of ll strings of nd which re of length 3n, for n = 0, 1, 2, (1) Determine wht to rememer out the input string Assign stte to ech of
More informationHomework 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 informationSolving the String Statistics Problem in Time O(n log n)
Alcom-FT Technicl Report Series ALCOMFT-TR-02-55 Solving the String Sttistics Prolem in Time O(n log n) Gerth Stølting Brodl 1,,, Rune B. Lyngsø 3, Ann Östlin1,, nd Christin N. S. Pedersen 1,2, 1 BRICS,
More informationOn 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 informationCS103 Handout 32 Fall 2016 November 11, 2016 Problem Set 7
CS103 Hndout 32 Fll 2016 Novemer 11, 2016 Prolem Set 7 Wht cn you do with regulr expressions? Wht re the limits of regulr lnguges? On this prolem set, you'll find out! As lwys, plese feel free to drop
More informationParse trees, ambiguity, and Chomsky normal form
Prse trees, miguity, nd Chomsky norml form In this lecture we will discuss few importnt notions connected with contextfree grmmrs, including prse trees, miguity, nd specil form for context-free grmmrs
More informationRegular Languages and Applications
Regulr Lnguges nd Applictions Yo-Su Hn Deprtment of Computer Science Yonsei University 1-1 SNU 4/14 Regulr Lnguges An old nd well-known topic in CS Kleene Theorem in 1959 FA (finite-stte utomton) constructions:
More informationChapter 5 Plan-Space Planning
Lecture slides for Automted Plnning: Theory nd Prctice Chpter 5 Pln-Spce Plnning Dn S. Nu CMSC 722, AI Plnning University of Mrylnd, Spring 2008 1 Stte-Spce Plnning Motivtion g 1 1 g 4 4 s 0 g 5 5 g 2
More informationRandom subgroups of a free group
Rndom sugroups of free group Frédérique Bssino LIPN - Lortoire d Informtique de Pris Nord, Université Pris 13 - CNRS Joint work with Armndo Mrtino, Cyril Nicud, Enric Ventur et Pscl Weil LIX My, 2015 Introduction
More informationCMPSCI 250: Introduction to Computation. Lecture #31: What DFA s Can and Can t Do David Mix Barrington 9 April 2014
CMPSCI 250: Introduction to Computtion Lecture #31: Wht DFA s Cn nd Cn t Do Dvid Mix Brrington 9 April 2014 Wht DFA s Cn nd Cn t Do Deterministic Finite Automt Forml Definition of DFA s Exmples of DFA
More informationMinimal DFA. minimal DFA for L starting from any other
Miniml DFA Among the mny DFAs ccepting the sme regulr lnguge L, there is exctly one (up to renming of sttes) which hs the smllest possile numer of sttes. Moreover, it is possile to otin tht miniml DFA
More informationDEFINITION The inner product of two functions f 1 and f 2 on an interval [a, b] is the number. ( f 1, f 2 ) b DEFINITION 11.1.
398 CHAPTER 11 ORTHOGONAL FUNCTIONS AND FOURIER SERIES 11.1 ORTHOGONAL FUNCTIONS REVIEW MATERIAL The notions of generlized vectors nd vector spces cn e found in ny liner lger text. INTRODUCTION The concepts
More information1 APL13: Suffix Arrays: more space reduction
1 APL13: Suffix Arrys: more spce reduction In Section??, we sw tht when lphbet size is included in the time nd spce bounds, the suffix tree for string of length m either requires Θ(m Σ ) spce or the minimum
More informationCS415 Compilers. Lexical Analysis and. These slides are based on slides copyrighted by Keith Cooper, Ken Kennedy & Linda Torczon at Rice University
CS415 Compilers Lexicl Anlysis nd These slides re sed on slides copyrighted y Keith Cooper, Ken Kennedy & Lind Torczon t Rice University First Progrmming Project Instruction Scheduling Project hs een posted
More informationFingerprint idea. Assume:
Fingerprint ide Assume: We cn compute fingerprint f(p) of P in O(m) time. If f(p) f(t[s.. s+m 1]), then P T[s.. s+m 1] We cn compre fingerprints in O(1) We cn compute f = f(t[s+1.. s+m]) from f(t[s.. s+m
More informationTheory of Computation Regular Languages. (NTU EE) Regular Languages Fall / 38
Theory of Computtion Regulr Lnguges (NTU EE) Regulr Lnguges Fll 2017 1 / 38 Schemtic of Finite Automt control 0 0 1 0 1 1 1 0 Figure: Schemtic of Finite Automt A finite utomton hs finite set of control
More informationTitle. Author(s) 髙木, 拓也. Issue Date DOI. Doc URL. Type. File Information. Studies on Efficient Index Construction for Multiple
Title Studies on Efficient Index Construction for Multiple Author(s) 髙木, 拓也 Issue Dte 2018-03-22 DOI 10.14943/doctorl.k13077 Doc URL http://hdl.hndle.net/2115/70687 Type theses (doctorl) File Informtion
More informationFinite 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 information2.4 Linear Inequalities and Interval Notation
.4 Liner Inequlities nd Intervl Nottion We wnt to solve equtions tht hve n inequlity symol insted of n equl sign. There re four inequlity symols tht we will look t: Less thn , Less thn or
More information1 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 informationJava II Finite Automata I
Jv II Finite Automt I Bernd Kiefer Bernd.Kiefer@dfki.de Deutsches Forschungszentrum für künstliche Intelligenz Finite Automt I p.1/13 Processing Regulr Expressions We lredy lerned out Jv s regulr expression
More informationFinite Automata-cont d
Automt Theory nd Forml Lnguges Professor Leslie Lnder Lecture # 6 Finite Automt-cont d The Pumping Lemm WEB SITE: http://ingwe.inghmton.edu/ ~lnder/cs573.html Septemer 18, 2000 Exmple 1 Consider L = {ww
More informationRegular expressions, Finite Automata, transition graphs are all the same!!
CSI 3104 /Winter 2011: Introduction to Forml Lnguges Chpter 7: Kleene s Theorem Chpter 7: Kleene s Theorem Regulr expressions, Finite Automt, trnsition grphs re ll the sme!! Dr. Neji Zgui CSI3104-W11 1
More informationComputing the Optimal Global Alignment Value. B = n. Score of = 1 Score of = a a c g a c g a. A = n. Classical Dynamic Programming: O(n )
Alignment Grph Alignment Mtrix Computing the Optiml Globl Alignment Vlue An Introduction to Bioinformtics Algorithms A = n c t 2 3 c c 4 g 5 g 6 7 8 9 B = n 0 c g c g 2 3 4 5 6 7 8 t 9 0 2 3 4 5 6 7 8
More informationTheory of Computation Regular Languages
Theory of Computtion Regulr Lnguges Bow-Yw Wng Acdemi Sinic Spring 2012 Bow-Yw Wng (Acdemi Sinic) Regulr Lnguges Spring 2012 1 / 38 Schemtic of Finite Automt control 0 0 1 0 1 1 1 0 Figure: Schemtic of
More informationState space systems analysis (continued) Stability. A. Definitions A system is said to be Asymptotically Stable (AS) when it satisfies
Stte spce systems nlysis (continued) Stbility A. Definitions A system is sid to be Asymptoticlly Stble (AS) when it stisfies ut () = 0, t > 0 lim xt () 0. t A system is AS if nd only if the impulse response
More informationSection 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 informationAlignment of Long Sequences. BMI/CS Spring 2016 Anthony Gitter
Alignment of Long Sequences BMI/CS 776 www.biostt.wisc.edu/bmi776/ Spring 2016 Anthony Gitter gitter@biostt.wisc.edu Gols for Lecture Key concepts how lrge-scle lignment differs from the simple cse the
More informationReview of basic calculus
Review of bsic clculus This brief review reclls some of the most importnt concepts, definitions, nd theorems from bsic clculus. It is not intended to tech bsic clculus from scrtch. If ny of the items below
More informationChapter 3 Polynomials
Dr M DRAIEF As described in the introduction of Chpter 1, pplictions of solving liner equtions rise in number of different settings In prticulr, we will in this chpter focus on the problem of modelling
More informationMath 1B, lecture 4: Error bounds for numerical methods
Mth B, lecture 4: Error bounds for numericl methods Nthn Pflueger 4 September 0 Introduction The five numericl methods descried in the previous lecture ll operte by the sme principle: they pproximte the
More informationCoalgebra, Lecture 15: Equations for Deterministic Automata
Colger, Lecture 15: Equtions for Deterministic Automt Julin Slmnc (nd Jurrin Rot) Decemer 19, 2016 In this lecture, we will study the concept of equtions for deterministic utomt. The notes re self contined
More informationNotes on length and conformal metrics
Notes on length nd conforml metrics We recll how to mesure the Eucliden distnce of n rc in the plne. Let α : [, b] R 2 be smooth (C ) rc. Tht is α(t) (x(t), y(t)) where x(t) nd y(t) re smooth rel vlued
More informationI1 = I2 I1 = I2 + I3 I1 + I2 = I3 + I4 I 3
2 The Prllel Circuit Electric Circuits: Figure 2- elow show ttery nd multiple resistors rrnged in prllel. Ech resistor receives portion of the current from the ttery sed on its resistnce. The split is
More informationAdministrivia CSE 190: Reinforcement Learning: An Introduction
Administrivi CSE 190: Reinforcement Lerning: An Introduction Any emil sent to me bout the course should hve CSE 190 in the subject line! Chpter 4: Dynmic Progrmming Acknowledgment: A good number of these
More informationChapter 14. Matrix Representations of Linear Transformations
Chpter 4 Mtrix Representtions of Liner Trnsformtions When considering the Het Stte Evolution, we found tht we could describe this process using multipliction by mtrix. This ws nice becuse computers cn
More information1 The Lagrange interpolation formula
Notes on Qudrture 1 The Lgrnge interpoltion formul We briefly recll the Lgrnge interpoltion formul. The strting point is collection of N + 1 rel points (x 0, y 0 ), (x 1, y 1 ),..., (x N, y N ), with x
More informationAPPROXIMATE INTEGRATION
APPROXIMATE INTEGRATION. Introduction We hve seen tht there re functions whose nti-derivtives cnnot be expressed in closed form. For these resons ny definite integrl involving these integrnds cnnot be
More informationAutomata 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 informationResearch Article Moment Inequalities and Complete Moment Convergence
Hindwi Publishing Corportion Journl of Inequlities nd Applictions Volume 2009, Article ID 271265, 14 pges doi:10.1155/2009/271265 Reserch Article Moment Inequlities nd Complete Moment Convergence Soo Hk
More informationCompiler Design. Fall Lexical Analysis. Sample Exercises and Solutions. Prof. Pedro C. Diniz
University of Southern Cliforni Computer Science Deprtment Compiler Design Fll Lexicl Anlysis Smple Exercises nd Solutions Prof. Pedro C. Diniz USC / Informtion Sciences Institute 4676 Admirlty Wy, Suite
More informationNote 12. Introduction to Digital Control Systems
Note Introduction to Digitl Control Systems Deprtment of Mechnicl Engineering, University Of Ssktchewn, 57 Cmpus Drive, Ssktoon, SK S7N 5A9, Cnd . Introduction A digitl control system is one in which the
More informationLet's start with an example:
Finite Automt Let's strt with n exmple: Here you see leled circles tht re sttes, nd leled rrows tht re trnsitions. One of the sttes is mrked "strt". One of the sttes hs doule circle; this is terminl stte
More informationFoundations of XML Types: Tree Automata
1 / 43 Foundtions of XML Types: Tree Automt Pierre Genevès CNRS (slides mostly sed on slides y W. Mrtens nd T. Schwentick) University of Grenole Alpes, 2017 2018 2 / 43 Why Tree Automt? Foundtions of XML
More informationStrong Bisimulation. Overview. References. Actions Labeled transition system Transition semantics Simulation Bisimulation
Strong Bisimultion Overview Actions Lbeled trnsition system Trnsition semntics Simultion Bisimultion References Robin Milner, Communiction nd Concurrency Robin Milner, Communicting nd Mobil Systems 32
More informationNFA DFA Example 3 CMSC 330: Organization of Programming Languages. Equivalence of DFAs and NFAs. Equivalence of DFAs and NFAs (cont.
NFA DFA Exmple 3 CMSC 330: Orgniztion of Progrmming Lnguges NFA {B,D,E {A,E {C,D {E Finite Automt, con't. R = { {A,E, {B,D,E, {C,D, {E 2 Equivlence of DFAs nd NFAs Any string from {A to either {D or {CD
More information1 From NFA to regular expression
Note 1: How to convert DFA/NFA to regulr expression Version: 1.0 S/EE 374, Fll 2017 Septemer 11, 2017 In this note, we show tht ny DFA cn e converted into regulr expression. Our construction would work
More informationCHAPTER 1 Regular Languages. Contents. definitions, examples, designing, regular operations. Non-deterministic Finite Automata (NFA)
Finite Automt (FA or DFA) CHAPTER Regulr Lnguges Contents definitions, exmples, designing, regulr opertions Non-deterministic Finite Automt (NFA) definitions, equivlence of NFAs DFAs, closure under regulr
More informationClosure Properties of Regular Languages
Closure Properties of Regulr Lnguges Regulr lnguges re closed under mny set opertions. Let L 1 nd L 2 e regulr lnguges. (1) L 1 L 2 (the union) is regulr. (2) L 1 L 2 (the conctention) is regulr. (3) L
More informationGenerating finite transformation semigroups: SgpWin
Generting finite trnsformtion semigroups: SgpWin Donld B. McAlister ( don@mth.niu.edu ) Deprtment of Mthemticl Sciences Northern Illinois University nd C.A.U.L. Septemer 5, 2006 Donld B. McAlister ( don@mth.niu.edu
More informationMath 61CM - Solutions to homework 9
Mth 61CM - Solutions to homework 9 Cédric De Groote November 30 th, 2018 Problem 1: Recll tht the left limit of function f t point c is defined s follows: lim f(x) = l x c if for ny > 0 there exists δ
More informationFormal 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 information1.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 informationLecture 08: Feb. 08, 2019
4CS4-6:Theory of Computtion(Closure on Reg. Lngs., regex to NDFA, DFA to regex) Prof. K.R. Chowdhry Lecture 08: Fe. 08, 2019 : Professor of CS Disclimer: These notes hve not een sujected to the usul scrutiny
More informationMath& 152 Section Integration by Parts
Mth& 5 Section 7. - Integrtion by Prts Integrtion by prts is rule tht trnsforms the integrl of the product of two functions into other (idelly simpler) integrls. Recll from Clculus I tht given two differentible
More information3 Regular expressions
3 Regulr expressions Given n lphet Σ lnguge is set of words L Σ. So fr we were le to descrie lnguges either y using set theory (i.e. enumertion or comprehension) or y n utomton. In this section we shll
More informationCommon intervals of genomes. Mathieu Raffinot CNRS LIAFA
Common intervls of genomes Mthieu Rffinot CNRS LIF Context: omprtive genomis. set of genomes prtilly/totlly nnotte Informtive group of genes or omins? Ex: COG tse Mny iffiulties! iology Wht re two similr
More informationA Symbolic Approach to Control via Approximate Bisimulations
A Symolic Approch to Control vi Approximte Bisimultions Antoine Girrd Lortoire Jen Kuntzmnn, Université Joseph Fourier Grenole, Frnce Interntionl Symposium on Innovtive Mthemticl Modelling Tokyo, Jpn,
More informationNON-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 informationLesson 1: Quadratic Equations
Lesson 1: Qudrtic Equtions Qudrtic Eqution: The qudrtic eqution in form is. In this section, we will review 4 methods of qudrtic equtions, nd when it is most to use ech method. 1. 3.. 4. Method 1: Fctoring
More informationName 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 informationGold s algorithm. Acknowledgements. Why would this be true? Gold's Algorithm. 1 Key ideas. Strings as states
Acknowledgements Gold s lgorithm Lurent Miclet, Jose Oncin nd Tim Otes for previous versions of these slides. Rfel Crrsco, Pco Cscuert, Rémi Eyrud, Philippe Ezequel, Henning Fernu, Thierry Murgue, Frnck
More informationFundamentals of Computer Science
Fundmentls of Computer Science Chpter 3: NFA nd DFA equivlence Regulr expressions Henrik Björklund Umeå University Jnury 23, 2014 NFA nd DFA equivlence As we shll see, it turns out tht NFA nd DFA re equivlent,
More informationThe 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 informationQUADRATURE is an old-fashioned word that refers to
World Acdemy of Science Engineering nd Technology Interntionl Journl of Mthemticl nd Computtionl Sciences Vol:5 No:7 011 A New Qudrture Rule Derived from Spline Interpoltion with Error Anlysis Hdi Tghvfrd
More informationGNFA GNFA GNFA GNFA GNFA
DFA RE NFA DFA -NFA REX GNFA Definition GNFA A generlize noneterministic finite utomton (GNFA) is grph whose eges re lele y regulr expressions, with unique strt stte with in-egree, n unique finl stte with
More informationMath 1431 Section M TH 4:00 PM 6:00 PM Susan Wheeler Office Hours: Wed 6:00 7:00 PM Online ***NOTE LABS ARE MON AND WED
Mth 43 Section 4839 M TH 4: PM 6: PM Susn Wheeler swheeler@mth.uh.edu Office Hours: Wed 6: 7: PM Online ***NOTE LABS ARE MON AND WED t :3 PM to 3: pm ONLINE Approimting the re under curve given the type
More information