On the size of Boyer-Moore automata
type: Item
instance of: scholarly article
title: On the size of Boyer-Moore automata
zbMATH Open document ID: 1191.68374
author: Véronique Bruyère
author: Olivier Delgrange
author: Rodrigo Scheihing
author: Ricardo Baeza-Yates
published in: Theoretical Computer Science
publication date: 2009-10-09T00:00:00Z
Mathematics Subject Classification ID: 68Q45
zbMATH DE Number: 5612531
MaRDI profile type: Publication
full work available at URL: j.tcs.2009.07.024
OpenAlex ID: W2002651966
cites work: Q5592246
cites work: Q4385510
cites work: The Boyer–Moore–Galil String Searching Strategies Revisited
cites work: On Boyer-Moore automata
cites work: Q4430300
cites work: A fast string searching algorithm
cites work: Q3138957
cites work: Q4849531
cites work: On improving the worst case running time of the Boyer-Moore string matching algorithm
cites work: Q3746902
cites work: Fast Pattern Matching in Strings
DOI: 10.1016/J.TCS.2009.07.024
Recommended article: On Boyer-Moore automata
Recommended article: Q3747737
Recommended article: Q4412581
Recommended article: On the size of logical automata
Recommended article: On the complexity of finite autonomous Moore automata
Recommended article: Q4779182
Recommended article: On the Size of the Universal Automaton of a Regular Language
Recommended article: Bounds on the automata size for Presburger arithmetic
Recommended article: Q3971281
Recommended article: On the Size Complexity of Rotating and Sweeping Automata
description: scientific article; zbMATH DE number 5612531