Saving Space in Fast String-Matching

DOI10.1137/0209032zbMath0446.68041OpenAlexW2026678577MaRDI QIDQ3891771

Joel I. Seiferas, Zvi Galil

Publication date: 1980

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0209032

zbMATH Keywords

Turing machinefailure functionstring-matchingtime-space trade-offpattern-matchingstring periodicitymultihead finite automatoncounter simulationtext-searching

Mathematics Subject Classification ID

Related Items (10)

Squares, cubes, and time-space efficient string searching ⋮ Detecting morphic images of a word: On the rank of a pattern ⋮ Saving comparisons in the Crochemore-Perrin string-matching algorithm ⋮ Simple real-time constant-space string matching ⋮ Linear-time string-matching using only a fixed number of local storage locations ⋮ Periods in strings ⋮ Detecting the morphic images of a word : improving the general algorithm ⋮ Correctness and efficiency of pattern matching algorithms ⋮ Simple Real-Time Constant-Space String Matching ⋮ Time-space-optimal string matching

This page was built for publication: Saving Space in Fast String-Matching