Crossmark

The emptiness problem for tree automata with at least one global disequality constraint is NP-hard

Crossref DOI link: https://doi.org/10.1016/j.ipl.2016.09.007

Published Print: 2017-02

Update policy: https://doi.org/10.1016/elsevier_cm_policy

Authors

Héam, P.-C. https://orcid.org/0000-0002-1125-1767
Hugot, V.

Kouchnarenko, O. https://orcid.org/0000-0003-1482-9015
License Information

Text and Data Mining valid from 2017-02-01
More Information

This article is maintained by: Elsevier

Article Title: The emptiness problem for tree automata with at least one global disequality constraint is NP-hard

Journal Title: Information Processing Letters

CrossRef DOI link to publisher maintained version: https://doi.org/10.1016/j.ipl.2016.09.007

Content Type: article

Copyright: © 2016 Elsevier B.V. All rights reserved.