Optimal Parallel Construction of Minimal Suffix and Factor Automata
AbstractThis 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.
How to Cite
Breslauer, D., & Hariharan, R. (1995). Optimal Parallel Construction of Minimal Suffix and Factor Automata. BRICS Report Series, 2(16). https://doi.org/10.7146/brics.v2i16.19884
Articles published in DAIMI PB are licensed under a Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported License.