On the size of Boyer-Moore automata
From MaRDI portal
Publication:732040
DOI10.1016/J.TCS.2009.07.024zbMATH Open1191.68374OpenAlexW2002651966MaRDI QIDQ732040FDOQ732040
Authors: Véronique Bruyère, Olivier Delgrange, Rodrigo Scheihing, Ricardo 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
Recommendations
- On Boyer-Moore automata
- scientific article; zbMATH DE number 3984587
- scientific article; zbMATH DE number 1949657
- On the size of logical automata
- On the complexity of finite autonomous Moore automata
- scientific article; zbMATH DE number 1834685
- On the Size of the Universal Automaton of a Regular Language
- Bounds on the automata size for Presburger arithmetic
- scientific article; zbMATH DE number 8792
- On the Size Complexity of Rotating and Sweeping Automata
Cites Work
- Title not available (Why is that?)
- 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
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- On Boyer-Moore automata
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (3)
This page was built for publication: On the size of Boyer-Moore automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q732040)
