The Emptiness Problem for Tree Automata with Global Constraints
www.researchgate.net › ... › Automata
PDF | We define tree automata with global constraints (TAGC), generalizing the well-known class of tree automata with global equality and disequality.
Dec 2, 2014 · Abstract:The model of tree automata with equality and disequality constraints was introduced in 2007 by Filiot, Talbot and Tison.
Missing: global inequality
We define tree automata with global constraints (TAGC), generalizing the well-known class of tree automata with global equality and disequality constraints ...
Missing: hard. | Show results with:hard.
[PDF] The Emptiness Problem for Tree Automata with Global Constraints
www.lsv.fr › PDF › BCGJV-lics10
Abstract—We define tree automata with global constraints. (TAGC), generalizing the class of tree automata with global equality and disequality constraints ...
Missing: hard. | Show results with:hard.
People also ask
Is the emptiness problem decidable?
What is the emptiness problem in TOC?
Mar 22, 2011 · Abstract—We define tree automata with global constraints. (TAGC), generalizing the class of tree automata with global.
Missing: hard. | Show results with:hard.
It is shown that if there is at least one disequality constraint, the emptiness problem is NP-hard. The model of tree automata with equality and disequality ...
Missing: inequality | Show results with:inequality
In this paper we show that if there is at least one disequality constraint, the emptiness problem is NP-hard. 1 Introduction Tree automata are a pervasive ...
Sep 14, 2016 · The emptiness problem for tree automata with at least one global disequality constraint is NP-hard. P.-C. Héam a,∗. , V. Hugot b, O ...
Missing: inequality | Show results with:inequality
The Emptiness Problem for Tree Automata with at Least One Disequality Constraint is NP-hard ... least one disequality constraint, the emptiness problem is NP-hard ...
Vacher, The emptiness problem for tree automata with global constraints, in ... Tree automata with one memory, set constraints and cryptographic protocols.
Missing: hard. | Show results with:hard.