| Issue |
RAIRO-Theor. Inf. Appl.
Volume 45, Number 3, July-September 2011
|
|
|---|---|---|
| Page(s) | 347 - 370 | |
| DOI | https://doi.org/10.1051/ita/2011107 | |
| Published online | 22 August 2011 | |
Construction of tree automata from regular expressions
1
Fachgebiet Theoretische Informatik, Technische Universität
Ilmenau, Postfach 100565, 98684 Ilmenau, Germany. dietrich.kuske@tu-ilmenau.de
2
Institut für Informatik, Universität Leipzig, PF 100920,
04009 Leipzig, Germany. meinecke@informatik.uni-leipzig.de
Received:
26
May
2009
Accepted:
7
April
2011
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.
Mathematics Subject Classification: 68Q45
Key words: Trees / automata / regular expressions / partial derivatives
© EDP Sciences, 2011
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.