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
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Succinct representation for (non)deterministic finite automata |
scientific article |
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
