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
Preview
Unable to display preview. Download preview PDF.
References
A. Apostolico,C. Iliopoulos, G. Landau,B. Schieber, U. Vishkin, Parallel construction of a suffix tree with applications, Algorithmica 3,3 (1988) 347–365
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
A. Blumer,J. Blumer,D. Haussler,R. McConnel, A. Ehrenfeucht, Coplete inverted files for efficient text retrieval and analysis, JACM 34 (1987) 578–595
B. Chlebus,K. Diks,T. Radzik, Testing isomorphism of outerplanar graphs, MFCS'88, LNCS 324, 220–230
M.Chen,J.Seiferas, Efficient and elegant subword tree construction, in Combinatorial Algorithms on Words (ed.A.Apostolico,Z.Galil)
M.Crochemore, Transducers and repetitions, TCS 45 (1986)
M.Crochemore, W.Rytter, Parallel computations on strings and arrays, STACS' 90
A.Gibbons,W.Rytter, Efficient parallel algorithms, Cambridge University Press (1988)
R. Karp, R. Miller, A. Rosenberg, Rapid identification of repeated patterns in strings, arrays and trees, STOC 4 (1972) 125–136
W.Rytter, On the parallel transformations of regular expressions to nondeterministic finite automata, IPL 31, 103–109
Author information
Authors and Affiliations
Editor information
Rights 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