Deciding determinism of unary languages is coNP-complete (Q5300853)
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: Deciding determinism of unary languages is coNP-complete |
scientific article; zbMATH DE number 6182458
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Deciding determinism of unary languages is coNP-complete |
scientific article; zbMATH DE number 6182458 |
Statements
Deciding Determinism of Unary Languages Is coNP-Complete (English)
0 references
28 June 2013
0 references
0.9477738738059998
0 references
0.9453046321868896
0 references
0.7855979800224304
0 references
0.7846384644508362
0 references
0.767854630947113
0 references
