Abstract
We define the tree automata with height constraints between brothers (TACBB H ). Constraints of equalities and inequalities between heights of siblings that restrict the applicability of the rules are allowed in TACBB H. These constraints allow to express natural tree languages like complete or balanced (like AVL) trees. We prove decidability of emptiness and finiteness for TACBB H, and also for a more general class that additionally allows to combine equality and disequality constraints between brothers. © 2014 Springer International Publishing Switzerland.
Author supplied keywords
Cite
CITATION STYLE
Creus, C., & Godoy, G. (2014). Tree automata with height constraints between brothers. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8560 LNCS, pp. 149–163). Springer Verlag. https://doi.org/10.1007/978-3-319-08918-8_11
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
