Parallel construction of minimal suffix and factor automata
- 20 July 1990
- journal article
- Published by Elsevier in Information Processing Letters
- Vol. 35 (3) , 121-128
- https://doi.org/10.1016/0020-0190(90)90060-b
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Usefulness of the Karp-Miller-Rosenberg algorithm in parallel computations on strings and arraysTheoretical Computer Science, 1991
- A note on optimal parallel transformations of regular expressions to nondeterministic finite automataInformation Processing Letters, 1989
- Parallel construction of a suffix tree with applicationsAlgorithmica, 1988
- Complete inverted files for efficient text retrieval and analysisJournal of the ACM, 1987
- Transducers and repetitionsTheoretical Computer Science, 1986
- An Efficient Parallel Biconnectivity AlgorithmSIAM Journal on Computing, 1985
- The Myriad Virtues of Subword TreesPublished by Springer Nature ,1985
- The smallest automation recognizing the subwords of a textTheoretical Computer Science, 1985
- Fast Pattern Matching in StringsSIAM Journal on Computing, 1977
- A Space-Economical Suffix Tree Construction AlgorithmJournal of the ACM, 1976