Sciweavers

JALC
2007
95views more  JALC 2007»
14 years 11 days ago
Learning Regular Tree Languages from Correction and Equivalence Queries
Inspired by the results obtained in the string case, we present in this paper the extension of the correction queries to regular tree languages. Relying on Angluin’s and Sakakib...
Catalin Ionut Tîrnauca, Cristina Tîrna...
ITA
2007
101views Communications» more  ITA 2007»
14 years 11 days ago
Learning tree languages from text
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 Theoretical Computer Sc...
Henning Fernau