Add to ORKGThe model of tree automata with equality and disequality constraints was introduced in 2007 by Filiot, Talbot and Tison. In this paper we show that if there is at least one disequality constraint, the emptiness problem is NP-hard
We define tree automata with global equality and disequality constraints (TAGED). TAGEDs can test (d...
Tree automata on infinite trees are a powerful tool that is widely used for decision procedures and ...
Zero automata are a probabilistic extension of parity automata on infinite trees. The satisfiability...
The model of tree automata with equality and disequality constraints was introduced in 2007 by Filio...
We study an extension of tree automata on infinite trees with global equality and disequality constr...
In recent years, several extensions of tree automata have been considered. Most of them are related ...
International audienceWe define tree automata with global constraints (TAGC), generalizing the class...
We continue the study of bottom-up unranked tree automata with equality and disequality constraints...
International audienceWe define tree automata with global equality and disequality constraints (TAGE...
Automata are a widely used formalism in computer science as a concise representation for sets. They ...
International audienceThis article is inspired by two works from the early 90s. The first one is by ...
International audienceA tree automaton with global equality and disequality constraints, TAGED for s...
We define a class of ranked tree automata TABG generalizing both the tree automata with local tests ...
We define tree automata with global equality and disequality constraints (TAGED). TAGEDs can test (d...
Tree automata on infinite trees are a powerful tool that is widely used for decision procedures and ...
Zero automata are a probabilistic extension of parity automata on infinite trees. The satisfiability...
The model of tree automata with equality and disequality constraints was introduced in 2007 by Filio...
We study an extension of tree automata on infinite trees with global equality and disequality constr...
In recent years, several extensions of tree automata have been considered. Most of them are related ...
International audienceWe define tree automata with global constraints (TAGC), generalizing the class...
We continue the study of bottom-up unranked tree automata with equality and disequality constraints...
International audienceWe define tree automata with global equality and disequality constraints (TAGE...
Automata are a widely used formalism in computer science as a concise representation for sets. They ...
International audienceThis article is inspired by two works from the early 90s. The first one is by ...
International audienceA tree automaton with global equality and disequality constraints, TAGED for s...
We define a class of ranked tree automata TABG generalizing both the tree automata with local tests ...
We define tree automata with global equality and disequality constraints (TAGED). TAGEDs can test (d...
Tree automata on infinite trees are a powerful tool that is widely used for decision procedures and ...
Zero automata are a probabilistic extension of parity automata on infinite trees. The satisfiability...