Parallel construction of minimal suffix and factor automata

DOI10.1016/0020-0190(90)90060-BzbMATH Open0697.68059OpenAlexW1975346675MaRDI QIDQ911778FDOQ911778

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

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

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)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• A Space-Economical Suffix Tree Construction Algorithm
• Fast Pattern Matching in Strings
• Parallel construction of a suffix tree with applications
• An Efficient Parallel Biconnectivity Algorithm
• The smallest automaton recognizing the subwords of a text
• Title not available (Why is that?)
• Title not available (Why is that?)
• Transducers and repetitions
• Complete inverted files for efficient text retrieval and analysis
• Correction: Parallel Merge Sort
• Title not available (Why is that?)
• Title not available (Why is that?)
• A note on optimal parallel transformations of regular expressions to nondeterministic finite automata
• Title not available (Why is that?)

Cited In (2)

• Title not available (Why is that?)
• Fast parallel Lyndon factorization with applications

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)