Advertisement

Optimal Factor Transducers

  • Maxime Crochemore
Part of the NATO ASI Series book series (volume 12)

Abstract

Amons strins-matchins alsorithms the two most efficient methoos of Knuth-Morris-Pratt [KMP 77] and Weiner [We 73] are usually considered as opposite of each others, In this paper we show that automata theory unifies the two approaches and sives a simple and efficient alsorithm to construct the structure, a sequential transducer, underlyins Weiner’s method.

Keywords

Span Tree Suffix Tree Default State Finite Alphabet Failure Function 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [AHU 74]
    A,V.Aho, J,E.Hopcroft, J.D.Ullman, The desirAn and analysis of computer al51orithms, (Addison-Wesley, Readin~. Mass., 1974 ).Google Scholar
  2. [AU 791]
    A,V,Aho, J.D.Ullman. Principles of compiler desin, ( Addison-Wesley, Readin~, Mass., 1979 ).Google Scholar
  3. [EAR 83]
    A,Apostolico, F.P.Preparata. Optimal off-line detectinn of repetitions in a strinst, Theor,Comput,Sci.,22(1983)297–315.MathSciNetCrossRefGoogle Scholar
  4. [BBEHM 83]
    A.Blumer, J.Blumer, A.Ehrenfeucht, D,Haussler, R.Mcconnell, Linear size finite automata for the set of all subwords of a word, Bulletin of the EATCS,21(1983)12–2O.Google Scholar
  5. [BM 77]
    R.Boyer, J.S.Moore. A fast strin searchin al~orithm, Commun,Assoc.Comput.Mach.,20,10(1977)762–772MATHCrossRefGoogle Scholar
  6. [Cr 83]
    M.Cnochemore. Recherche lineaire d’un carre dans un mot, C.R,Acad.Sci,Paris,t.296,serie I(1983)781–784.Google Scholar
  7. [KMP 77]
    D.E.Xnuth, J,H.Morris, V.R,Pratt. Fast pattern-matchinu in strin5s, S.I.A,M,J.Comput,°6(1977)323–350.Google Scholar
  8. [Mc 76]
    E,m.Mccreight. A space-economical suffix tree construction al-lorithm, J,A,C.M.,23,2(1976)262–272.MathSciNetMATHGoogle Scholar
  9. [Ro 827.1]
    M.Rodeh. A fast test for unioue decipherability based on suffix tree, I,E.E,E,Trans,Information Theory,28,4,1982,648–651CrossRefGoogle Scholar
  10. [We 73]
    P.Weiner, Linear pattern-matchin5A alEiorithms, iot.(Proceedin~s of the 14th annual symposium on switchin5A and automata theory, 1973)1–11.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1985

Authors and Affiliations

  • Maxime Crochemore
    • 1
  1. 1.Laboratoire d’InformatiqueUniversite de Haute-Normandie and L.I.T.P.ParisFrance

Personalised recommendations