On the size of Boyer-Moore automata
From MaRDI portal
Publication:732040
DOI10.1016/j.tcs.2009.07.024zbMath1191.68374OpenAlexW2002651966MaRDI QIDQ732040
Véronique Bruyère, Olivier Delgrange, Rodrigo Scheihing, Ricardo A. Baeza-Yates
Publication date: 9 October 2009
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2009.07.024
Cites Work
- On Boyer-Moore automata
- 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
- Fast Pattern Matching in Strings
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: On the size of Boyer-Moore automata
