The finite automata approaches in stringology (Q3165665)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6099694
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The finite automata approaches in stringology |
scientific article; zbMATH DE number 6099694 |
Statements
29 October 2012
0 references
exact pattern matching
0 references
approximate pattern matching
0 references
finite automata
0 references
dynamic programming
0 references
bitwise parallelism
0 references
suffix automaton
0 references
border array
0 references
degenerate symbol
0 references
0 references
0.7714110016822815
0 references
0.7505020499229431
0 references
0.7498366236686707
0 references
