On String Pattern Matching: A New Model with a Polynomial Time Algorithm
- 1 February 1981
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 10 (1) , 118-140
- https://doi.org/10.1137/0210010
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- Macro SPITBOL—a SNOBOL4 compilerSoftware: Practice and Experience, 1977
- Tools for the measurement of SNOBOL4 programsACM SIGPLAN Notices, 1975
- An infinite hierarchy of intersections of context-free languagesTheory of Computing Systems, 1973
- A theory of discrete patterns and their implementation in SNOBOL4Communications of the ACM, 1973
- Towards a theory of data structuresJournal of Computer and System Sciences, 1971
- An efficient context-free parsing algorithmCommunications of the ACM, 1970
- Studies in abstract families of languagesMemoirs of the American Mathematical Society, 1969