The emptiness problem for tree automata with at least one global disequality constraint is NP-hard (Q344514)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The emptiness problem for tree automata with at least one global disequality constraint is NP-hard |
scientific article |
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
