Abstract
We propose an extension of the tree automata with constraints between direct subtrees (Bogaert and Tison, 1992) to unranked trees. Our approach uses MSO-formulas to capture the possibility of comparing unboundedly many direct subtrees. Our main result is that the nonemptiness problem for the deterministic automata, as in the ranked setting, is decidable, Furthermore, we show that the nondeterministic automata are more expressive than the deterministic ones. © Springer-Verlag Berlin Heidelberg 2007.
Cite
CITATION STYLE
Karianto, W., & Löding, C. (2007). Unranked tree automata with sibling equalities and disequalities. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4596 LNCS, pp. 875–887). Springer Verlag. https://doi.org/10.1007/978-3-540-73420-8_75
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
