Optimal Parallel Construction of Minimal Suffix and Factor Automata

Dany Breslauer
Ramesh Hariharan

February 1995


This paper gives optimal parallel algorithms for the construction of the smallest deterministic finite automata recognizing all the suffixes and the factors of a string. The algorithms use recently discovered optimal parallel suffix tree construction algorithms together with data structures for the efficient manipulation of trees, exploiting the well known relation between suffix and factor automata and suffix trees.

Available as PostScript, PDF, DVI.


Last modified: 2003-06-08 by webmaster.