On Nondeterministic Unranked Tree Automata with Sibling Constraints

Christof Löding & Karianto Wong
We continue the study of bottom-up unranked tree automata with equality and disequality constraints between direct subtrees. In particular, we show that the emptiness problem for the nondeterministic automata is decidable. In addition, we show that the universality problem, in contrast, is undecidable.
This data center is not currently reporting usage information. For information on how your repository can submit usage information, please see our Documentation.