On Boyer-Moore automata

DOI10.1007/BF01185428zbMath0822.68025OpenAlexW2052314860MaRDI QIDQ1336957

Ricardo A. Baeza-Yates, Christian Choffrut, Gaston H. Gonnet

Publication date: 9 October 1995

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01185428

zbMATH Keywords

Boyer-Moore automatonfast pattern matchingBoyer-Moore's algorithm

Mathematics Subject Classification ID

Searching and sorting (68P10) Formal languages and automata (68Q45) Parallel algorithms in computer science (68W10) Distributed algorithms (68W15)

Related Items

String-matching with OBDDs ⋮ A variation on the Boyer-Moore algorithm ⋮ On the size of Boyer-Moore automata

Cites Work

• Average running time of the Boyer-Moore-Horspool algorithm
• On improving the worst case running time of the Boyer-Moore string matching algorithm
• A fast string searching algorithm
• The Boyer–Moore–Galil String Searching Strategies Revisited
• The Complexity of Pattern Matching for a Random String
• A New Proof of the Linearity of the Boyer-Moore String Searching Algorithm
• On the Worst-Case Behavior of String-Searching Algorithms
• Fast Pattern Matching in Strings
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item