The Emptiness Problem for Tree Automata with at Least One Disequality Constraint is NP-hard.
Pierre-Cyrille HéamVincent HugotOlga KouchnarenkoPublished in: CoRR (2014)
Keyphrases
- tree automata
- np hard
- finite automata
- regular expressions
- finite state
- optimal solution
- syntactic pattern recognition
- context free grammars
- np complete
- tree languages
- special case
- lower bound
- finite automaton
- constraint satisfaction problems
- markov chain
- positive and negative
- object oriented
- information extraction
- query language
- search space
- computational complexity