The emptiness problem for tree automata with at least one global disequality constraint is NP-hard (Q344514)
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 6655338
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The emptiness problem for tree automata with at least one global disequality constraint is NP-hard |
scientific article; zbMATH DE number 6655338 |
Statements
The emptiness problem for tree automata with at least one global disequality constraint is NP-hard (English)
0 references
23 November 2016
0 references
formal languages
0 references
tree automata
0 references
algorithms
0 references
0 references
0 references
0.8224183320999146
0 references
0.7799432873725891
0 references
0.7709791660308838
0 references
0.7637258768081665
0 references
0.7583951354026794
0 references
