Tree automata with height constraints between brothers
Document typeConference report
Rights accessRestricted access - publisher's policy
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.
CitationCreus, C.; Godoy, G. Tree automata with height constraints between brothers. A: International Conference on Rewriting Techniques and Applications. "Rewriting and Typed Lambda Calculi : Joint International Conference, RTA-TLCA 2014, held as part of the Vienna Summer of Logic, VSL 2014 : Vienna, Austria, July 14-17, 2014 : Proceedings". Viena: Springer, 2014, p. 149-163.
|Creus - Godoy.pdf||271.1Kb||Restricted access|