Approximate NFA universality and related problems motivated by information theory (Q6093572)
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: Approximate NFA universality and related problems motivated by information theory |
scientific article; zbMATH DE number 7735121
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Approximate NFA universality and related problems motivated by information theory |
scientific article; zbMATH DE number 7735121 |
Statements
Approximate NFA universality and related problems motivated by information theory (English)
0 references
7 September 2023
0 references
NFA universality
0 references
approximation
0 references
randomized algorithm
0 references
PSPACE-hardness
0 references
0 references
0.746826171875
0 references
0.7398854494094849
0 references
0.7395503520965576
0 references
0.7287493348121643
0 references
