Checking history-determinism is NP-hard for parity automata (Q6629459)
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: Checking history-determinism is NP-hard for parity automata |
scientific article; zbMATH DE number 7935687
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Checking history-determinism is NP-hard for parity automata |
scientific article; zbMATH DE number 7935687 |
Statements
Checking history-determinism is NP-hard for parity automata (English)
0 references
30 October 2024
0 references
