On Boyer-Moore automata
type: Item
instance of: scholarly article
title: On Boyer-Moore automata
zbMATH Open document ID: 0822.68025
DOI: 10.1007/BF01185428
author: Ricardo Baeza-Yates
author: Christian Choffrut
author: Gaston H. Gonnet
published in: Algorithmica
publication date: 1995-10-09T00:00:00Z
Mathematics Subject Classification ID: 68P10
Mathematics Subject Classification ID: 68W10
Mathematics Subject Classification ID: 68Q45
Mathematics Subject Classification ID: 68W15
zbMATH DE Number: 672032
zbMATH Keywords: Boyer-Moore automaton
zbMATH Keywords: fast pattern matching
zbMATH Keywords: Boyer-Moore's algorithm
MaRDI profile type: Publication
cites work: Q4385510
cites work: The Boyer–Moore–Galil String Searching Strategies Revisited
cites work: A fast string searching algorithm
cites work: Q4028877
cites work: Q3138910
cites work: Average running time of the Boyer-Moore-Horspool algorithm
cites work: Q3971281
cites work: On improving the worst case running time of the Boyer-Moore string matching algorithm
cites work: Q3746902
cites work: A New Proof of the Linearity of the Boyer-Moore String Searching Algorithm
cites work: Fast Pattern Matching in Strings
cites work: Q3322961
cites work: On the Worst-Case Behavior of String-Searching Algorithms
cites work: The Complexity of Pattern Matching for a Random String
full work available at URL: https://doi.org/10.1007/bf01185428
OpenAlex ID: W2052314860
Recommended article: On the size of Boyer-Moore automata
Recommended article: Q3747737
Recommended article: On the complexity of finite autonomous Moore automata
Recommended article: Q3971281
Recommended article: On the behaviour and simplicity of finite Moore automata
Recommended article: Q3774953
Recommended article: Q3751012
Recommended article: Nondeterministic Moore Automata and Brzozowski’s Algorithm
Recommended article: Q4891188
Recommended article: Q3596881
description: scientific article; zbMATH DE number 672032