Skip to main content
SpringerLink
Log in

Parallel construction of minimal suffix and factor automata

  • Communications
  • Conference paper
  • First Online:
Mathematical Foundations of Computer Science 1990 (MFCS 1990)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 452))

Abstract

The main result of the paper is an efficient parallel construction of factor automata. We show that the construction of directed acyclic word graphs (dawg's) and of minimal suffix and minimal factor automata can be done by almost optimal parallel algorithms (optimal within logarithmic factor). Our constructions have the same parallel complexity as the best known parallel algorithms computing suffix trees. We exploit a simple relation between dawg's and suffix trees.

The research of this author was supported by the grant RP.I.09 from Inst. of Informatics, Warsaw University

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. A. Apostolico,C. Iliopoulos, G. Landau,B. Schieber, U. Vishkin, Parallel construction of a suffix tree with applications, Algorithmica 3,3 (1988) 347–365

    Google Scholar 

  2. A. Blumer, J. Blumer,D. Haussler,A. Echrefeucht, M. Chen,J. Seiferas, The smallest automaton recognizing subwords of the text, Th. Comp.Sco.40 (1985) 31–55

    Google Scholar 

  3. A. Blumer,J. Blumer,D. Haussler,R. McConnel, A. Ehrenfeucht, Coplete inverted files for efficient text retrieval and analysis, JACM 34 (1987) 578–595

    Google Scholar 

  4. B. Chlebus,K. Diks,T. Radzik, Testing isomorphism of outerplanar graphs, MFCS'88, LNCS 324, 220–230

    Google Scholar 

  5. M.Chen,J.Seiferas, Efficient and elegant subword tree construction, in Combinatorial Algorithms on Words (ed.A.Apostolico,Z.Galil)

    Google Scholar 

  6. M.Crochemore, Transducers and repetitions, TCS 45 (1986)

    Google Scholar 

  7. M.Crochemore, W.Rytter, Parallel computations on strings and arrays, STACS' 90

    Google Scholar 

  8. A.Gibbons,W.Rytter, Efficient parallel algorithms, Cambridge University Press (1988)

    Google Scholar 

  9. R. Karp, R. Miller, A. Rosenberg, Rapid identification of repeated patterns in strings, arrays and trees, STOC 4 (1972) 125–136

    Google Scholar 

  10. W.Rytter, On the parallel transformations of regular expressions to nondeterministic finite automata, IPL 31, 103–109

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. LITP, Universite Paris VII, 2 Place Jussieu, F-75251, Paris, France

    Maxime Crochemore

  2. Institute of Informatics, Warsaw University, PKiN VIII p, 00-901, Warszawa, Poland

    Wojciech Rytter

Authors
  1. Maxime Crochemore
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Wojciech Rytter
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Branislav Rovan

Rights and permissions

Reprints and permissions

Copyright information

© 1990 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Crochemore, M., Rytter, W. (1990). Parallel construction of minimal suffix and factor automata. In: Rovan, B. (eds) Mathematical Foundations of Computer Science 1990. MFCS 1990. Lecture Notes in Computer Science, vol 452. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0029611

Download citation

  • DOI: https://doi.org/10.1007/BFb0029611

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-52953-8

  • Online ISBN: 978-3-540-47185-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation