Parallel construction of minimal suffix and factor automata

DOI10.1016/0020-0190(90)90060-BzbMath0697.68059OpenAlexW1975346675MaRDI QIDQ911778

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

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

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

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