Beyond hyper-minimisation -- minimising DBAs and DPAs is NP-complete (Q2908870)
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: Beyond hyper-minimisation -- minimising DBAs and DPAs is NP-complete |
scientific article; zbMATH DE number 6073549
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Beyond hyper-minimisation -- minimising DBAs and DPAs is NP-complete |
scientific article; zbMATH DE number 6073549 |
Statements
29 August 2012
0 references
automata theory
0 references
complexity
0 references
Büchi automata
0 references
parity automata
0 references
Beyond hyper-minimisation -- minimising DBAs and DPAs is NP-complete (English)
0 references
