On the size of Boyer-Moore automata

DOI10.1016/J.TCS.2009.07.024MaRDI QIDQ732040zbMATHOpenAlexFDO

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

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• On Boyer-Moore automata
• Publication:3747737
• Publication:4412581
• On the size of logical automata
• On the complexity of finite autonomous Moore automata
• Publication:4779182
• On the Size of the Universal Automaton of a Regular Language
• Bounds on the automata size for Presburger arithmetic
• Publication:3971281
• On the Size Complexity of Rotating and Sweeping Automata

Cites work

• scientific article; zbMATH DE number 432823 (Why is no real title available?)
• scientific article; zbMATH DE number 3982538 (Why is no real title available?)
• scientific article; zbMATH DE number 1142294 (Why is no real title available?)
• scientific article; zbMATH DE number 1988973 (Why is no real title available?)
• scientific article; zbMATH DE number 801745 (Why is no real title available?)
• scientific article; zbMATH DE number 3311755 (Why is no real title available?)
• A fast string searching algorithm
• Fast Pattern Matching in Strings
• On Boyer-Moore automata
• On improving the worst case running time of the Boyer-Moore string matching algorithm
• The Boyer–Moore–Galil String Searching Strategies Revisited

Cited in

(3)

• A variation on the Boyer-Moore algorithm
• scientific article; zbMATH DE number 3984587 (Why is no real title available?)
• On Boyer-Moore automata

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)