Linear-time string-matching using only a fixed number of local storage locations (Q1149761): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
links / mardi / name | links / mardi / name | ||
Revision as of 05:15, 31 January 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