Succinct representations for (non)deterministic finite automata (Q2232264)
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 representations for (non)deterministic finite automata |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Succinct representations for (non)deterministic finite automata |
scientific article |
Statements
Succinct representations for (non)deterministic finite automata (English)
0 references
4 October 2021
0 references
data and image compression
0 references
computational complexity
0 references
0 references
