A compact representation of nondeterministic (suffix) automata for the bit-parallel approach (Q418159)
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: A compact representation of nondeterministic (suffix) automata for the bit-parallel approach |
scientific article; zbMATH DE number 6038303
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A compact representation of nondeterministic (suffix) automata for the bit-parallel approach |
scientific article; zbMATH DE number 6038303 |
Statements
A compact representation of nondeterministic (suffix) automata for the bit-parallel approach (English)
0 references
24 May 2012
0 references
strings
0 references
factorization of strings
0 references
bit-parallelism
0 references
nondeterministic automaton
0 references
nondeterministic suffix automaton
0 references
Shift-And
0 references
BNDM
0 references
1.000001072883606
0 references
0.8857817053794861
0 references
0.8584827184677124
0 references
0.8351655602455139
0 references
0.8221603035926819
0 references
