Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.
Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.
Pierre-Cyrille Héam, Vincent Hugot, Olga Kouchnarenko. The emptiness problem for tree automata with at least one global disequality constraint is NP-hard. Inf. Process. Lett., 118:6-9, 2017. [doi]
Abstract is missing.