Automata for Matching Patterns
- 1 January 1997
- book chapter
- Published by Springer Nature
Abstract
No abstract availableKeywords
This publication has 20 references indexed in Scilit:
- Dictionary-Matching on Unbounded Alphabets: Uniform Length DictionariesJournal of Algorithms, 1995
- On Boyer-Moore automataAlgorithmica, 1994
- Dynamic dictionary matchingJournal of Computer and System Sciences, 1994
- Tight comparison bounds for the string prefix-matching problemInformation Processing Letters, 1993
- String-matching on ordered alphabetsTheoretical Computer Science, 1992
- Two-way string-matchingJournal of the ACM, 1991
- Transducers and repetitionsTheoretical Computer Science, 1986
- The smallest automation recognizing the subwords of a textTheoretical Computer Science, 1985
- A fast string searching algorithmCommunications of the ACM, 1977
- Efficient string matchingCommunications of the ACM, 1975