加载中…
2014-12-02
The Emptiness Problem for Tree Automata with at Least One Disequality Constraint is NP-hard
P. -C HéamV. HugotO. Kouchnarenko
文献摘要
The 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.
讨论
0讲解博客
生成讲解博客的中文版本
AI智能校验
生成AI智能校验的中文版本