Parallel construction of minimal suffix and factor automata
- 737 Downloads
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.
KeywordsEquivalence Class Parallel Algorithm Finite Automaton Suffix Tree Local Transformation
Unable to display preview. Download preview PDF.
- /AILSV 88/.A. Apostolico,C. Iliopoulos, G. Landau,B. Schieber, U. Vishkin, Parallel construction of a suffix tree with applications, Algorithmica 3,3 (1988) 347–365Google Scholar
- /BBHECS 85/.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–55Google Scholar
- /BBHCE 87/.A. Blumer,J. Blumer,D. Haussler,R. McConnel, A. Ehrenfeucht, Coplete inverted files for efficient text retrieval and analysis, JACM 34 (1987) 578–595Google Scholar
- /CDR 88/.B. Chlebus,K. Diks,T. Radzik, Testing isomorphism of outerplanar graphs, MFCS'88, LNCS 324, 220–230Google Scholar
- /CS 85/.M.Chen,J.Seiferas, Efficient and elegant subword tree construction, in Combinatorial Algorithms on Words (ed.A.Apostolico,Z.Galil)Google Scholar
- /Cr 86/.M.Crochemore, Transducers and repetitions, TCS 45 (1986)Google Scholar
- /CR 90/.M.Crochemore, W.Rytter, Parallel computations on strings and arrays, STACS' 90Google Scholar
- /GR 88/.A.Gibbons,W.Rytter, Efficient parallel algorithms, Cambridge University Press (1988)Google Scholar
- /KMR 72/.R. Karp, R. Miller, A. Rosenberg, Rapid identification of repeated patterns in strings, arrays and trees, STOC 4 (1972) 125–136Google Scholar
- /Ry 89/.W.Rytter, On the parallel transformations of regular expressions to nondeterministic finite automata, IPL 31, 103–109Google Scholar