文章基本信息

标题：Optimal Parallel Construction of Minimal Suffix and Factor Automata
本地全文：下载
作者：Dany Breslauer ; Ramesh Hariharan
期刊名称：BRICS Report Series
印刷版ISSN：0909-0878
出版年度：1995
卷号：2
期号：16
出版社：Aarhus University
摘要：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.