Maximal universal width of an AFA is NP-hard (Q6975896)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 8048739
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Maximal universal width of an AFA is NP-hard |
scientific article; zbMATH DE number 8048739 |
Statements
Maximal universal width of an AFA is NP-hard (English)
0 references
2 June 2025
0 references
alternating finite automaton
0 references
existential width
0 references
universal width
0 references
algorithmic complexity
0 references
NP-hardness
0 references
0 references
0 references
