Beyond Hyper-Minimisation--Minimising DBAs and DPAs is NP-Complete (Q2908870)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Beyond Hyper-Minimisation--Minimising DBAs and DPAs is NP-Complete |
scientific article |
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
