Since 2014
Optimal Parallel Construction of Minimal Suffix and Factor Automata
BRICS Report Series
View Archive Info| Field | Value | |
| Title |
Optimal Parallel Construction of Minimal Suffix and Factor Automata
|
|
| Creator |
Breslauer, Dany
Hariharan, Ramesh |
|
| Description |
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.
|
|
| Publisher |
Aarhus University
|
|
| Contributor |
—
|
|
| Date |
1995-01-16
|
|
| Type |
info:eu-repo/semantics/article
info:eu-repo/semantics/publishedVersion — |
|
| Format |
application/pdf
|
|
| Identifier |
https://tidsskrift.dk/brics/article/view/19884
10.7146/brics.v2i16.19884 |
|
| Source |
BRICS Report Series; No 16 (1995): RS-16 Optimal Parallel Construction of Minimal Suffix and Factor Automata
BRICS Report Series; No 16 (1995): RS-16 Optimal Parallel Construction of Minimal Suffix and Factor Automata 1601-5355 0909-0878 |
|
| Language |
eng
|
|
| Relation |
https://tidsskrift.dk/brics/article/view/19884/17537
|
|
| Rights |
Copyright (c) 2015 BRICS Report Series
|
|