Succinct representation for (non)deterministic finite automata (Q2084735)
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: Succinct representation for (non)deterministic finite automata |
scientific article; zbMATH DE number 7601247
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Succinct representation for (non)deterministic finite automata |
scientific article; zbMATH DE number 7601247 |
Statements
Succinct representation for (non)deterministic finite automata (English)
0 references
13 October 2022
0 references
succinct data structures
0 references
deterministic finite automata
0 references
encoding
0 references
time-space tradeoff
0 references
0 references
0.7810195684432983
0 references
0.7810190320014954
0 references
0.7657520174980164
0 references
0.7648639678955078
0 references
