| Issue |
RAIRO-Theor. Inf. Appl.
Volume 41, Number 4, October-December 2007
|
|
|---|---|---|
| Page(s) | 351 - 374 | |
| DOI | https://doi.org/10.1051/ita:2007030 | |
| Published online | 25 September 2007 | |
Learning tree languages from text
Fachbereich IV, Abteilung Informatik, Universität Trier, 54286 Trier, Germany;
fernau@uni-trier.de
We study the problem of learning regular tree languages from text. We show that the framework of function distinguishability, as introduced by the author in [Theoret. Comput. Sci. 290 (2003) 1679–1711], can be generalized from the case of string languages towards tree languages. This provides a large source of identifiable classes of regular tree languages. Each of these classes can be characterized in various ways. Moreover, we present a generic inference algorithm with polynomial update time and prove its correctness. In this way, we generalize previous works of Angluin, Sakakibara and ourselves. Moreover, we show that this way all regular tree languages can be approximately identified.
Mathematics Subject Classification: 68Q32 / 68Q45
© EDP Sciences, 2007
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.