Parallel construction of minimal suffix and factor automata
From MaRDI portal
Publication:911778
DOI10.1016/0020-0190(90)90060-BzbMath0697.68059MaRDI QIDQ911778
Maxime Crochemore, Wojciech Rytter
Publication date: 1990
Published in: Information Processing Letters (Search for Journal in Brave)
finite automata; formal languages; concurrent-write model; exclusive-write model; parallel agorithms
Cites Work
- The smallest automaton recognizing the subwords of a text
- Parallel construction of a suffix tree with applications
- Transducers and repetitions
- A note on optimal parallel transformations of regular expressions to nondeterministic finite automata
- An Efficient Parallel Biconnectivity Algorithm
- A Space-Economical Suffix Tree Construction Algorithm
- Fast Pattern Matching in Strings
- Correction: Parallel Merge Sort
- Complete inverted files for efficient text retrieval and analysis
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item