Looking for All Palindromes in a String
|
|
- Thomas McDowell
- 6 years ago
- Views:
Transcription
1 Looking or All Plindromes in String Shih Jng Pn nd R C T Lee Deprtment o Computer Science nd Inormtion Engineering, Ntionl Chi-Nn University, Puli, Nntou Hsien,, Tiwn, ROC sjpn@lgdoccsiencnuedutw, rctlee@ncnuedutw Abstrct A plindrome is string o the orm αα', where α nd α' re lso strings nd reverse to ech other The problem o the pper is deined s ollows: given string S o length n, ind ll plindromes occurring in the given string S In the pper, we present n lgorithm bsed on suix trees to ind plindromes Our lgorithm will ind ll mximum plindromes which re not contined in ny other plindromes Ater inding mximum plindromes, we utilize eliminting opertions to ind other plindromes which re contined in mximum plindromes Introduction Let us irst deine plindromes Given stringα = α α 2 Lα n, α' = α nα n Lα is clled the reverse o α The string αα' is clled plindrome For exmple, bb nd cddc re both plindromes To look or DNA sequences contining plindromes is importnt in biology Mny reserchers hve discussed the plindrome problem [] Suix trees hve been used extensively by mny lgorithms [] Gusield proposed n lgorithm bsed on suix trees to ind ll tndem repets in given DNA sequence In this pper, we modiy the ide in nd present suix tree pproch to del with the plindrome problem 2 A suix tree pproch to detect ll plindromes 2 Term deinition Given n input string K, we irst dd chrcter which does not occur in K to the end o the input string The new string is denoted s K Then, we reverse the given string K nd dd chrcter ' which does not occur in the string to the end o the reversed string The new string is denoted s K We now construct suix tree or both K nd K Assume tht we hve K = cbb nd K = bbc' We will construct suix tree or K nd K To clerly describe the suix tree, we need mny indices or nodes o it They will be explined below () Rule : Ech le node is ssocited with either K or K, indicted by the or ' on the edge ending t the le node s indicted in Fig () (2) Rule 2: I le node is ssocited with K ( K ) there is n index i ( i r ), indicting the strting loction o the ssocited string The index i ( i r ) is in regulr type (itlic type) s indicted in Fig () () Rule : For ech node, except the root node, the collection o le indices below the node is clled orwrd collection or reversed collection or K or K The indices collected in orwrd nd reversed collections re enclosed in ( ) prentheses I the numbers inside the prenthesis re in regulr type (itlic type), they re ssocited with K ( K ) s indicted in Fig (b) We urther hve Rule s ollows: Rule : For ech node, the length rom the root to the node is denoted s D (v) D (v) is shown in [ ] brcket s shown in Fig 2 The bove results re merged nd shown in Fig For our lgorithm o plindrome inding, we need the ollowing terms s deined below () Eliminting opertion: Given plindrome string S = s s 2 Lsn, the eliminting opertion deletes the irst nd lst chrcters o the given string S The remining string S' = s2 Lsn is lso plindrome For exmple, bb is generted rom cbbc by n eliminting opertion (2) Mximum Plindromes: A substring T o S is mximum plindrome o S i T is not contined ny other plindrome o S For exmple, in the string dcbbce, the substring cbbc is mximum plindrome while bb is not
2 () Figure 6 root ' 6 ' c (,)(2,) () b bb c' (2,) b (,) b ()(2) () b () (2)() c' c' c' () () 2 (2) () 2 (2) (b) K cbb nd bbc' = = Figure 2 22 The Method interested in the node indicted by the rrow sign In this section, we irst present the lgorithm bsed on suix trees to ind ll mximum plindromes in given string We construct the suix tree o K nd K At ech node v, we check whether there exist i nd i r such tht i + i r = (n D(v) + 2) I the substring ssocited with this node is mximum plindrome, we will ind i nd i r such tht i + i r = (n D(v) + 2) On the other hnd, i i + i r = (n D(v) + 2) or some i nd i r, the substring corresponding to this node must be plindrome, but not necessrily mximum plindrome We now use the input string cbb to explin the bove discussion Consider Fig whose suix tree is constructed or cbb nd bbc' We re For this pointed node, i = 2, i r =, n =, nd D(v) = Thus i + i r = (n D(v) + 2) Thus i + i r = (n D(v) + 2) The substring corresponding to this node is bb nd is mximum plindrome By using n eliminting opertion, we get nother plindrome For other nodes o the suix tree, the ormul does not hold So there re not other mximum plindromes We now show nother exmple cbbbb The suix tree is shown in Fig For the let pointed node, n = 8 nd D(v) = Besides there exist i = 2, nd i r = Thus the ormul
3 Figure Figure i + i r = (n D(v) + 2) holds or such i nd ir The substring corresponding to this node is bb which is mximum plindrome By using eliminting opertion, we get nother plindrome bb For other nodes, the ormul does not hold So there re not other mximum plindromes We cn esily see tht we cn ind nother two mximum plindromes t the other two pointed nodes They re bbbb nd bb We would like to point out tht we my ind nother bb which is plindrome, but not mximum plindrome In the ollowing, we present the lgorithm or inding ll mximum plindromes Algorithm Input: string S with length n Output: ll plindromes which occur in S Add chrcter which does not occur in S to the end o S The new string is denoted s S ' 2 Add chrcter ' which does not occur in the string to the end o the reversed input string S The new string is denoted s S' Construct the suix tree or S ' nd S'
4 bbbb 8 (8) () [9] () () [7] 9 (9) [] ' bb c' 6 ' root c ()(8) [] (2,,6)(,,7) [] bb bb 2 (2) [8] b c' 8 (8) 7 (7) [] (2,6) [] (2) (,7,8)(,) [] c' 9 (9) [] b 7 (7) [] c' (,7)(,) c' 6 (,6)(2) bb ()(,) [] bb (2) c' () [9] ()() c' () [7] 2 (2) [8] Figure Figure 6 Collect the orwrd, reversed collections or S ' or S' nd ind D (v) or ech node in the suix tree For ech node v o the suix tree, check whether there exist i nd i r such tht i + ir = ( n D( v) + 2) I yes, return the substring corresponding to this node v s possible mximum plindrome o S 6 Utilize eliminting opertions to ll plindromes obtined in the bove procedures to produce more plindromes The correctness o our proposed lgorithm We inlly discuss why the lgorithm works Let us ssume tht there is mximum plindrome strting t i with length k in the given string S Then there must be mximum plindrome string t i in S As shown in Fig 6, we hve r i + k + i r = n But, on the suix tree constructed out o, we hve: S nd S K = D(v) Thus, we hve i + i = ( n D( v) + 2) Conclusions r In this pper, we presented n lgorithm bsed on suix trees to ind ll plindromes in given string The min gol is ctully to deine new kind o plindromes, nmely plindromes with gps between α nd α' We hve lredy some preliminry result to indicte tht our present lgorithm, with modiiction, cn be used to ind the new kind o plindromes, which cnnot be ound by using the Mncher lgorithm This is our uture reserch
5 Reerence [] D Gusield Algorithms on Strings, Trees, nd Sequences Cmbridge University Press,997 G Mncher A New liner-time "On-Line" Algorithm or Finding the Smllest Initil Plindrome o String Journl o the Assocition or Computing Mchinery, 97 [] A Porto, V Brbos Finding Approximte Plindromes in Strings Pttern Recognition, 2002 R Gupt, A Mittl, V Nrng, S Wing-Kin Detection o Plindromes in DNA Sequences Using Periodicity Trnsorm IEEE Interntionl Workshop on Biomedicl Circuits & Systems, 200 J Stoye, D Gusield Simple nd lexible detection o contiguous repets using suix tree Theoreticl Computer Science, 2002
Closure 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 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 informationENGI 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 informationSCHOOL 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 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 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 informationa a a a a a a a a a a a a a a a a a a a a a a a In this section, we introduce a general formula for computing determinants.
Section 9 The Lplce Expnsion In the lst section, we defined the determinnt of (3 3) mtrix A 12 to be 22 12 21 22 2231 22 12 21. In this section, we introduce generl formul for computing determinnts. Rewriting
More informationOn Second Derivative-Free Zero Finding Methods
010 Americn Control Conerence Mrriott Wterront, Bltimore, MD, USA June 30-July 0, 010 FrC07.4 On Second Derivtive-Free Zero Finding Methods Mohmmed A. Hsn Deprtment o Electricl & Computer Engineering University
More informationNumerical Linear Algebra Assignment 008
Numericl Liner Algebr Assignment 008 Nguyen Qun B Hong Students t Fculty of Mth nd Computer Science, Ho Chi Minh University of Science, Vietnm emil. nguyenqunbhong@gmil.com blog. http://hongnguyenqunb.wordpress.com
More informationNew 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 informationChapter 10: Symmetrical Components and Unbalanced Faults, Part II
Chpter : Symmetricl Components nd Unblnced Fults, Prt.4 Sequence Networks o Loded Genertor n the igure to the right is genertor supplying threephse lod with neutrl connected through impednce n to ground.
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 informationFirst Midterm Examination
Çnky University Deprtment of Computer Engineering 203-204 Fll Semester First Midterm Exmintion ) Design DFA for ll strings over the lphet Σ = {,, c} in which there is no, no nd no cc. 2) Wht lnguge does
More informationAnatomy of a Deterministic Finite Automaton. Deterministic Finite Automata. A machine so simple that you can understand it in less than one minute
Victor Admchik Dnny Sletor Gret Theoreticl Ides In Computer Science CS 5-25 Spring 2 Lecture 2 Mr 3, 2 Crnegie Mellon University Deterministic Finite Automt Finite Automt A mchine so simple tht you cn
More informationFor convenience, we rewrite m2 s m2 = m m m ; where m is repeted m times. Since xyz = m m m nd jxyj»m, we hve tht the string y is substring of the fir
CSCI 2400 Models of Computtion, Section 3 Solutions to Homework 4 Problem 1. ll the solutions below refer to the Pumping Lemm of Theorem 4.8, pge 119. () L = f n b l k : k n + lg Let's ssume for contrdiction
More informationAQA Further Pure 1. Complex Numbers. Section 1: Introduction to Complex Numbers. The number system
Complex Numbers Section 1: Introduction to Complex Numbers Notes nd Exmples These notes contin subsections on The number system Adding nd subtrcting complex numbers Multiplying complex numbers Complex
More informationZero-Sum Magic Graphs and Their Null Sets
Zero-Sum Mgic Grphs nd Their Null Sets Ebrhim Slehi Deprtment of Mthemticl Sciences University of Nevd Ls Vegs Ls Vegs, NV 89154-4020. ebrhim.slehi@unlv.edu Abstrct For ny h N, grph G = (V, E) is sid to
More informationCS 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 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 informationCS375: Logic and Theory of Computing
CS375: Logic nd Theory of Computing Fuhu (Frnk) Cheng Deprtment of Computer Science University of Kentucky 1 Tble of Contents: Week 1: Preliminries (set lgebr, reltions, functions) (red Chpters 1-4) Weeks
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 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 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 informationQuadrature Rules for Evaluation of Hyper Singular Integrals
Applied Mthemticl Sciences, Vol., 01, no. 117, 539-55 HIKARI Ltd, www.m-hikri.com http://d.doi.org/10.19/ms.01.75 Qudrture Rules or Evlution o Hyper Singulr Integrls Prsnt Kumr Mohnty Deprtment o Mthemtics
More informationSimple Gamma Rings With Involutions.
IOSR Journl of Mthemtics (IOSR-JM) ISSN: 2278-5728. Volume 4, Issue (Nov. - Dec. 2012), PP 40-48 Simple Gmm Rings With Involutions. 1 A.C. Pul nd 2 Md. Sbur Uddin 1 Deprtment of Mthemtics University of
More information13.3 CLASSICAL STRAIGHTEDGE AND COMPASS CONSTRUCTIONS
33 CLASSICAL STRAIGHTEDGE AND COMPASS CONSTRUCTIONS As simple ppliction of the results we hve obtined on lgebric extensions, nd in prticulr on the multiplictivity of extension degrees, we cn nswer (in
More informationNew data structures to reduce data size and search time
New dt structures to reduce dt size nd serch time Tsuneo Kuwbr Deprtment of Informtion Sciences, Fculty of Science, Kngw University, Hirtsuk-shi, Jpn FIT2018 1D-1, No2, pp1-4 Copyright (c)2018 by The Institute
More informationLinear and Non-linear Feedback Control Strategies for a 4D Hyperchaotic System
Pure nd Applied Mthemtics Journl 017; 6(1): 5-13 http://www.sciencepublishinggroup.com/j/pmj doi: 10.11648/j.pmj.0170601.1 ISSN: 36-9790 (Print); ISSN: 36-981 (Online) Liner nd Non-liner Feedbck Control
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 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 informationSection 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 informationSuppose we want to find the area under the parabola and above the x axis, between the lines x = 2 and x = -2.
Mth 43 Section 6. Section 6.: 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
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 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 informationA short introduction to local fractional complex analysis
A short introduction to locl rctionl complex nlysis Yng Xio-Jun Deprtment o Mthemtics Mechnics, hin University o Mining Technology, Xuhou mpus, Xuhou, Jingsu, 228, P R dyngxiojun@63com This pper presents
More informationLecture 09: Myhill-Nerode Theorem
CS 373: Theory of Computtion Mdhusudn Prthsrthy Lecture 09: Myhill-Nerode Theorem 16 Ferury 2010 In this lecture, we will see tht every lnguge hs unique miniml DFA We will see this fct from two perspectives
More informationConvert the NFA into DFA
Convert the NF into F For ech NF we cn find F ccepting the sme lnguge. The numer of sttes of the F could e exponentil in the numer of sttes of the NF, ut in prctice this worst cse occurs rrely. lgorithm:
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 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 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 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 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 informationLecture 6 Regular Grammars
Lecture 6 Regulr Grmmrs COT 4420 Theory of Computtion Section 3.3 Grmmr A grmmr G is defined s qudruple G = (V, T, S, P) V is finite set of vribles T is finite set of terminl symbols S V is specil vrible
More informationFinite Automata. Informatics 2A: Lecture 3. John Longley. 22 September School of Informatics University of Edinburgh
Lnguges nd Automt Finite Automt Informtics 2A: Lecture 3 John Longley School of Informtics University of Edinburgh jrl@inf.ed.c.uk 22 September 2017 1 / 30 Lnguges nd Automt 1 Lnguges nd Automt Wht is
More information11.1 Finite Automata. CS125 Lecture 11 Fall Motivation: TMs without a tape: maybe we can at least fully understand such a simple model?
CS125 Lecture 11 Fll 2016 11.1 Finite Automt Motivtion: TMs without tpe: mybe we cn t lest fully understnd such simple model? Algorithms (e.g. string mtching) Computing with very limited memory Forml verifiction
More informationHermite-Hadamard type inequalities for harmonically convex functions
Hcettepe Journl o Mthemtics nd Sttistics Volume 43 6 4 935 94 Hermite-Hdmrd type ineulities or hrmoniclly convex unctions İmdt İşcn Abstrct The uthor introduces the concept o hrmoniclly convex unctions
More informationGlobal alignment. Genome Rearrangements Finding preserved genes. Lecture 18
Computt onl Biology Leture 18 Genome Rerrngements Finding preserved genes We hve seen before how to rerrnge genome to obtin nother one bsed on: Reversls Knowledge of preserved bloks (or genes) Now we re
More informationCS 275 Automata and Formal Language Theory
CS 275 Automt nd Forml Lnguge Theory Course Notes Prt II: The Recognition Problem (II) Chpter II.5.: Properties of Context Free Grmmrs (14) Anton Setzer (Bsed on book drft by J. V. Tucker nd K. Stephenson)
More informationIntroduction to Group Theory
Introduction to Group Theory Let G be n rbitrry set of elements, typiclly denoted s, b, c,, tht is, let G = {, b, c, }. A binry opertion in G is rule tht ssocites with ech ordered pir (,b) of elements
More information[Lakshmi, 5(2): February, 2016] ISSN: (I2OR), Publication Impact Factor: 3.785
[Lkshmi, 5): Februry, 0] ISSN: 77-955 IOR), Publiction Imct Fctor: 785 IJESRT INTERNTIONL JOURNL OF ENGINEERING SCIENCES & RESERCH TECHNOLOGY SUB -TRIDENT FORM THROUGH FUZZY SUB -TRINGULR FORM Prveen Prksh,
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 informationIntroduction To Matrices MCV 4UI Assignment #1
Introduction To Mtrices MCV UI Assignment # INTRODUCTION: A mtrix plurl: mtrices) is rectngulr rry of numbers rrnged in rows nd columns Exmples: ) b) c) [ ] d) Ech number ppering in the rry is sid to be
More informationSUMMER KNOWHOW STUDY AND LEARNING CENTRE
SUMMER KNOWHOW STUDY AND LEARNING CENTRE Indices & Logrithms 2 Contents Indices.2 Frctionl Indices.4 Logrithms 6 Exponentil equtions. Simplifying Surds 13 Opertions on Surds..16 Scientific Nottion..18
More informationC. C^mpenu, K. Slom, S. Yu upper boun of mn. So our result is tight only for incomplete DF's. For restricte vlues of m n n we present exmples of DF's
Journl of utomt, Lnguges n Combintorics u (v) w, x{y c OttovonGuerickeUniversitt Mgeburg Tight lower boun for the stte complexity of shue of regulr lnguges Cezr C^mpenu, Ki Slom Computing n Informtion
More informationset 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 informationAUTOMATA AND LANGUAGES. Definition 1.5: Finite Automaton
25. Finite Automt AUTOMATA AND LANGUAGES A system of computtion tht only hs finite numer of possile sttes cn e modeled using finite utomton A finite utomton is often illustrted s stte digrm d d d. d q
More informationCSE : Exam 3-ANSWERS, Spring 2011 Time: 50 minutes
CSE 260-002: Exm 3-ANSWERS, Spring 20 ime: 50 minutes Nme: his exm hs 4 pges nd 0 prolems totling 00 points. his exm is closed ook nd closed notes.. Wrshll s lgorithm for trnsitive closure computtion is
More informationExercises Chapter 1. Exercise 1.1. Let Σ be an alphabet. Prove wv = w + v for all strings w and v.
1 Exercises Chpter 1 Exercise 1.1. Let Σ e n lphet. Prove wv = w + v for ll strings w nd v. Prove # (wv) = # (w)+# (v) for every symol Σ nd every string w,v Σ. Exercise 1.2. Let w 1,w 2,...,w k e k strings,
More informationN 0 completions on partial matrices
N 0 completions on prtil mtrices C. Jordán C. Mendes Arújo Jun R. Torregros Instituto de Mtemátic Multidisciplinr / Centro de Mtemátic Universidd Politécnic de Vlenci / Universidde do Minho Cmino de Ver
More informationHW3, Math 307. CSUF. Spring 2007.
HW, Mth 7. CSUF. Spring 7. Nsser M. Abbsi Spring 7 Compiled on November 5, 8 t 8:8m public Contents Section.6, problem Section.6, problem Section.6, problem 5 Section.6, problem 7 6 5 Section.6, problem
More information1.2. Linear Variable Coefficient Equations. y + b "! = a y + b " Remark: The case b = 0 and a non-constant can be solved with the same idea as above.
1 12 Liner Vrible Coefficient Equtions Section Objective(s): Review: Constnt Coefficient Equtions Solving Vrible Coefficient Equtions The Integrting Fctor Method The Bernoulli Eqution 121 Review: Constnt
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 informationCOSC 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 informationCS 275 Automata and Formal Language Theory
CS 275 Automt nd Forml Lnguge Theory Course Notes Prt II: The Recognition Problem (II) Chpter II.6.: Push Down Automt Remrk: This mteril is no longer tught nd not directly exm relevnt Anton Setzer (Bsed
More informationModule 6: LINEAR TRANSFORMATIONS
Module 6: LINEAR TRANSFORMATIONS. Trnsformtions nd mtrices Trnsformtions re generliztions of functions. A vector x in some set S n is mpped into m nother vector y T( x). A trnsformtion is liner if, for
More informationBinding Numbers for all Fractional (a, b, k)-critical Graphs
Filomt 28:4 (2014), 709 713 DOI 10.2298/FIL1404709Z Published by Fculty of Sciences nd Mthemtics, University of Niš, Serbi Avilble t: http://www.pmf.ni.c.rs/filomt Binding Numbers for ll Frctionl (, b,
More informationA new algorithm for generating Pythagorean triples 1
A new lgorithm for generting Pythgoren triples 1 RH Dye 2 nd RWD Nicklls 3 The Mthemticl Gzette (1998; 82 (Mrch, No. 493, pp. 86 91 http://www.nicklls.org/dick/ppers/mths/pythgtriples1998.pdf 1 Introduction
More informationCS 330 Formal Methods and Models Dana Richards, George Mason University, Spring 2016 Quiz Solutions
CS 330 Forml Methods nd Models Dn Richrds, George Mson University, Spring 2016 Quiz Solutions Quiz 1, Propositionl Logic Dte: Ferury 9 1. (4pts) ((p q) (q r)) (p r), prove tutology using truth tles. p
More informationSpeech Recognition Lecture 2: Finite Automata and Finite-State Transducers. Mehryar Mohri Courant Institute and Google Research
Speech Recognition Lecture 2: Finite Automt nd Finite-Stte Trnsducers Mehryr Mohri Cournt Institute nd Google Reserch mohri@cims.nyu.com Preliminries Finite lphet Σ, empty string. Set of ll strings over
More informationSimplified Robotics Joint-Space Trajectory Generation with Via Point using a Single Polynomial
R.L. Willims II, 13, Simplified Robotics Joint-Spce Trjectory Genertion with i Point using Single Polynomil, Hindwi Journl of Robotics, Article ID 735958, 6 pges, Mrch, doi: 1.1155/13/735958. Simplified
More informationStudies on Nuclear Fuel Rod Thermal Performance
Avilble online t www.sciencedirect.com Energy Procedi 1 (1) 1 17 Studies on Nucler Fuel od herml Performnce Eskndri, M.1; Bvndi, A ; Mihndoost, A3* 1 Deprtment of Physics, Islmic Azd University, Shirz
More informationHomework Solution - Set 5 Due: Friday 10/03/08
CE 96 Introduction to the Theory of Computtion ll 2008 Homework olution - et 5 Due: ridy 10/0/08 1. Textook, Pge 86, Exercise 1.21. () 1 2 Add new strt stte nd finl stte. Mke originl finl stte non-finl.
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 informationHere we study square linear systems and properties of their coefficient matrices as they relate to the solution set of the linear system.
Section 24 Nonsingulr Liner Systems Here we study squre liner systems nd properties of their coefficient mtrices s they relte to the solution set of the liner system Let A be n n Then we know from previous
More informationA New Grey-rough Set Model Based on Interval-Valued Grey Sets
Proceedings of the 009 IEEE Interntionl Conference on Systems Mn nd Cybernetics Sn ntonio TX US - October 009 New Grey-rough Set Model sed on Intervl-Vlued Grey Sets Wu Shunxing Deprtment of utomtion Ximen
More information1 nonlinear.mcd Find solution root to nonlinear algebraic equation f(x)=0. Instructor: Nam Sun Wang
nonlinermc Fin solution root to nonliner lgebric eqution ()= Instructor: Nm Sun Wng Bckgroun In science n engineering, we oten encounter lgebric equtions where we wnt to in root(s) tht stisies given eqution
More informationSection 3.2: Negative Exponents
Section 3.2: Negtive Exponents Objective: Simplify expressions with negtive exponents using the properties of exponents. There re few specil exponent properties tht del with exponents tht re not positive.
More informationCS 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 informationNon Deterministic Automata. Linz: Nondeterministic Finite Accepters, page 51
Non Deterministic Automt Linz: Nondeterministic Finite Accepters, pge 51 1 Nondeterministic Finite Accepter (NFA) Alphbet ={} q 1 q2 q 0 q 3 2 Nondeterministic Finite Accepter (NFA) Alphbet ={} Two choices
More informationTaylor Polynomial Inequalities
Tylor Polynomil Inequlities Ben Glin September 17, 24 Abstrct There re instnces where we my wish to pproximte the vlue of complicted function round given point by constructing simpler function such s polynomil
More informationa,b a 1 a 2 a 3 a,b 1 a,b a,b 2 3 a,b a,b a 2 a,b CS Determinisitic Finite Automata 1
CS4 45- Determinisitic Finite Automt -: Genertors vs. Checkers Regulr expressions re one wy to specify forml lnguge String Genertor Genertes strings in the lnguge Deterministic Finite Automt (DFA) re nother
More informationRecursively Enumerable and Recursive. Languages
Recursively Enumerble nd Recursive nguges 1 Recll Definition (clss 19.pdf) Definition 10.4, inz, 6 th, pge 279 et S be set of strings. An enumertion procedure for Turing Mchine tht genertes ll strings
More informationFrobenius numbers of generalized Fibonacci semigroups
Frobenius numbers of generlized Fiboncci semigroups Gretchen L. Mtthews 1 Deprtment of Mthemticl Sciences, Clemson University, Clemson, SC 29634-0975, USA gmtthe@clemson.edu Received:, Accepted:, Published:
More information2.4 Linear Inequalities and Problem Solving
Section.4 Liner Inequlities nd Problem Solving 77.4 Liner Inequlities nd Problem Solving S 1 Use Intervl Nottion. Solve Liner Inequlities Using the Addition Property of Inequlity. 3 Solve Liner Inequlities
More informationDEFINITION OF ASSOCIATIVE OR DIRECT PRODUCT AND ROTATION OF VECTORS
3 DEFINITION OF ASSOCIATIVE OR DIRECT PRODUCT AND ROTATION OF VECTORS This chpter summrizes few properties of Cli ord Algebr nd describe its usefulness in e ecting vector rottions. 3.1 De nition of Associtive
More informationPredict Global Earth Temperature using Linier Regression
Predict Globl Erth Temperture using Linier Regression Edwin Swndi Sijbt (23516012) Progrm Studi Mgister Informtik Sekolh Teknik Elektro dn Informtik ITB Jl. Gnesh 10 Bndung 40132, Indonesi 23516012@std.stei.itb.c.id
More informationSpanning tree congestion of some product graphs
Spnning tree congestion of some product grphs Hiu-Fi Lw Mthemticl Institute Oxford University 4-9 St Giles Oxford, OX1 3LB, United Kingdom e-mil: lwh@mths.ox.c.uk nd Mikhil I. Ostrovskii Deprtment of Mthemtics
More informationNumerical integration
2 Numericl integrtion This is pge i Printer: Opque this 2. Introduction Numericl integrtion is problem tht is prt of mny problems in the economics nd econometrics literture. The orgniztion of this chpter
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 information20 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 informationMATRICES AND VECTORS SPACE
MATRICES AND VECTORS SPACE MATRICES AND MATRIX OPERATIONS SYSTEM OF LINEAR EQUATIONS DETERMINANTS VECTORS IN -SPACE AND -SPACE GENERAL VECTOR SPACES INNER PRODUCT SPACES EIGENVALUES, EIGENVECTORS LINEAR
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 informationInfinite Geometric Series
Infinite Geometric Series Finite Geometric Series ( finite SUM) Let 0 < r < 1, nd let n be positive integer. Consider the finite sum It turns out there is simple lgebric expression tht is equivlent to
More informationExpected Value of Function of Uncertain Variables
Journl of Uncertin Systems Vol.4, No.3, pp.8-86, 2 Online t: www.jus.org.uk Expected Vlue of Function of Uncertin Vribles Yuhn Liu, Minghu H College of Mthemtics nd Computer Sciences, Hebei University,
More informationChapter 3 Single Random Variables and Probability Distributions (Part 2)
Chpter 3 Single Rndom Vriles nd Proilit Distriutions (Prt ) Contents Wht is Rndom Vrile? Proilit Distriution Functions Cumultive Distriution Function Proilit Densit Function Common Rndom Vriles nd their
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 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 informationRiemann Sums and Riemann Integrals
Riemnn Sums nd Riemnn Integrls Jmes K. Peterson Deprtment of Biologicl Sciences nd Deprtment of Mthemticl Sciences Clemson University August 26, 203 Outline Riemnn Sums Riemnn Integrls Properties Abstrct
More informationLinearly Similar Polynomials
Linerly Similr Polynomils rthur Holshouser 3600 Bullrd St. Chrlotte, NC, US Hrold Reiter Deprtment of Mthemticl Sciences University of North Crolin Chrlotte, Chrlotte, NC 28223, US hbreiter@uncc.edu stndrd
More information