String matching with constraints
- 23 November 2005
- book chapter
- Published by Springer Nature
Abstract
No abstract availableKeywords
This publication has 23 references indexed in Scilit:
- Transducers and repetitionsTheoretical Computer Science, 1986
- The smallest automation recognizing the subwords of a textTheoretical Computer Science, 1985
- Factorizing words over an ordered alphabetJournal of Algorithms, 1983
- Optimal off-line detection of repetitions in a stringTheoretical Computer Science, 1983
- String Matching in Real TimeJournal of the ACM, 1981
- Lexicographically least circular substringsInformation Processing Letters, 1980
- Avoidable patterns in strings of symbolsPacific Journal of Mathematics, 1979
- On improving the worst case running time of the Boyer-Moore string matching algorithmCommunications of the ACM, 1979
- A fast string searching algorithmCommunications of the ACM, 1977
- Efficient string matchingCommunications of the ACM, 1975