ICDT
2012
ACM
12 years 1 months ago
2012
ACM
We consider the problem of repairing unranked trees (e.g., XML documents) satisfying a given restriction specification R (e.g., a DTD) into unranked trees satisfying a given targ...
IJFCS
2010
13 years 9 months ago
2010
The fundamental properties of the class QUASI of quasi-relabeling relations are investigated. A quasi-relabeling relation is a tree relation that is de ned by a tree bimorphism (...
ITA
2007
13 years 10 months ago
2007
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...
CAAP
1994
14 years 2 months ago
1994
Top-context-free tree languages (called cor gulier by Arnold and Dauchet 1, 2]) constitute a natural subclass of context-free tree languages. In this paper, we give further evidenc...
ECML
2005
Springer
14 years 4 months ago
2005
Springer
This paper introduces a novel method for learning a wrapper for extraction of information from web pages, based upon (k,l)-contextual tree languages. It also introduces a method to...
FCT
2007
Springer
14 years 5 months ago
2007
Springer
We show that the family of tree languages recognized by weak alternating automata is closed by three set theoretic operations that correspond to sum, multiplication by ordinals <...