3 citations · 3 across the 2 of their papers we have counts for
2 papers
cs.FL2014
The Emptiness Problem for Tree Automata with at Least One Disequality Constraint is NP-hard
P. -C Héam, V. Hugot, O. 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 disequa…
cs.FL2014★ 3 cited
Deterministic Automata for Unordered Trees
Adrien Boiret, Vincent Hugot, Joachim Niehren +1
Automata for unordered unranked trees are relevant for defining schemas and queries for data trees in Json or Xml format. While the existing notions are well-investigated concernin…