Parallel construction of minimal suffix and factor automata

DOI10.1016/0020-0190(90)90060-BMaRDI QIDQ911778zbMATH OpenOpenAlexFDO

Authors Maxime Crochemore, Wojciech Rytter

Publication date 1990

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0020-0190(90)90060-b

zbMATH Keywords

finite automataformal languagesconcurrent-write modelexclusive-write modelparallel agorithms

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• scientific article; zbMATH DE number 18629
• On-line construction of suffix trees
• Parallel construction of a suffix tree with applications
• Optimal parallel suffix tree construction
• Optimal parallel suffix tree construction

Cites work

• scientific article; zbMATH DE number 4205980 (Why is no real title available?)
• scientific article; zbMATH DE number 3913711 (Why is no real title available?)
• scientific article; zbMATH DE number 3913713 (Why is no real title available?)
• scientific article; zbMATH DE number 4047160 (Why is no real title available?)
• scientific article; zbMATH DE number 4060741 (Why is no real title available?)
• scientific article; zbMATH DE number 43583 (Why is no real title available?)
• scientific article; zbMATH DE number 3511563 (Why is no real title available?)
• scientific article; zbMATH DE number 3551946 (Why is no real title available?)
• A Space-Economical Suffix Tree Construction Algorithm
• A note on optimal parallel transformations of regular expressions to nondeterministic finite automata
• An Efficient Parallel Biconnectivity Algorithm
• Complete inverted files for efficient text retrieval and analysis
• Correction: Parallel Merge Sort
• Fast Pattern Matching in Strings
• Parallel construction of a suffix tree with applications
• The smallest automaton recognizing the subwords of a text
• Transducers and repetitions

Cited in

(2)

• Fast parallel Lyndon factorization with applications
• scientific article; zbMATH DE number 18629 (Why is no real title available?)

This page was built for publication: Parallel construction of minimal suffix and factor automata

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q911778)