A compact representation of nondeterministic (suffix) automata for the bit-parallel approach (Q418159): Difference between revisions
From MaRDI portal
Changed an Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 04:44, 30 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A compact representation of nondeterministic (suffix) automata for the bit-parallel approach |
scientific article |
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
