Linear-time string-matching using only a fixed number of local storage locations (Q1149761)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Linear-time string-matching using only a fixed number of local storage locations |
scientific article; zbMATH DE number 3711345
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Linear-time string-matching using only a fixed number of local storage locations |
scientific article; zbMATH DE number 3711345 |
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
