Construction of Tree Automata from Regular Expressions

Abstract. Since recognizable tree languages are closed under the rational operations, every regular tree expression denotes a recognizable tree language. We provide an alternative proof to this fact that results in smaller tree automata. To this aim, we transfer Antimirov's partial derivatives from regular word expressions to regular tree expressions. For an analysis of the size of the resulting automaton as well as for algorithmic improvements, we also transfer the methods of Champarnaud and Ziadi from words to trees.

• Type: Conference
• Year: 2008
• Where: DLT
• Authors: Dietrich Kuske, Ingmar Meinecke
• Keywords: DLT 2008, Recognizable Tree Language, Regular Tree Expressions, Smaller Tree Automata, Theoretical Computer Science