Linear-time string-matching using only a fixed number of local storage locations

DOI10.1016/S0304-3975(81)80006-0zbMath0454.68008MaRDI QIDQ1149761

Zvi Galil, Joel I. Seiferas

Publication date: 1981

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

random-access machinewriting multihead finite automaton

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Discrete mathematics in relation to computer science (68R99) Algorithms in computer science (68W99)

Related Items (4)

Saving comparisons in the Crochemore-Perrin string-matching algorithm ⋮ Simple real-time constant-space string matching ⋮ Simple Real-Time Constant-Space String Matching ⋮ Time-space-optimal string matching

Cites Work

• Unnamed Item
• Saving Space in Fast String-Matching
• New Real-Time Simulations of Multihead Tape Units
• Fast Pattern Matching in Strings
• Real-time solutions of the origin-crossing problem

This page was built for publication: Linear-time string-matching using only a fixed number of local storage locations