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 |
|---|---|---|---|
| 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
