Linear-time string-matching using only a fixed number of local storage locations (Q1149761): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Removed claim: author (P16): Item:Q756422 |
||
| Property / author | |||
| Property / author: Joel I. Seiferas / rank | |||
Revision as of 20:56, 20 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Linear-time string-matching using only a fixed number of local storage locations |
scientific article |
Statements
Linear-time string-matching using only a fixed number of local storage locations (English)
0 references
1981
0 references
random-access machine
0 references
writing multihead finite automaton
0 references
