Login / Signup
The emptiness problem for tree automata with at least one global disequality constraint is NP-hard.
Pierre-Cyrille Héam
Vincent Hugot
Olga Kouchnarenko
Published in:
Inf. Process. Lett. (2017)
Keyphrases
</>
tree automata
np hard
finite automata
regular expressions
finite state
optimal solution
syntactic pattern recognition
finite automaton
special case
context free grammars
computational complexity
lower bound
high level
query language
model checking