Linear-time string-matching using only a fixed number of local storage locations
From MaRDI portal
Publication:1149761
DOI10.1016/S0304-3975(81)80006-0zbMath0454.68008MaRDI QIDQ1149761
Publication date: 1981
Published in: Theoretical Computer Science (Search for Journal in Brave)
68Q45: Formal languages and automata
68R99: Discrete mathematics in relation to computer science
68W99: Algorithms in computer science
Related Items
Simple real-time constant-space string matching, Saving comparisons in the Crochemore-Perrin string-matching algorithm, Time-space-optimal string matching, Simple Real-Time Constant-Space String Matching
Cites Work