Currently displaying 1 – 2 of 2

Showing per page

Order by Relevance | Title | Year of publication

Construction of tree automata from regular expressions

Dietrich KuskeIngmar Meinecke — 2011

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications

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...

Construction of tree automata from regular expressions

Dietrich KuskeIngmar Meinecke — 2011

RAIRO - Theoretical Informatics and Applications

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...

Page 1

Download Results (CSV)