Linear-time string-matching using only a fixed number of local storage locations (Q1149761)
From MaRDI portal
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
