Sciweavers

Share
ICDT
2012
ACM
226views Database» more  ICDT 2012»
6 years 11 months ago
Bounded repairability for regular tree languages
We consider the problem of repairing unranked trees (e.g., XML documents) satisfying a given restriction speciļ¬cation R (e.g., a DTD) into unranked trees satisfying a given targ...
Gabriele Puppis, Cristian Riveros, Slawek Staworko
IJFCS
2010
60views more  IJFCS 2010»
8 years 7 months ago
Properties of Quasi-Relabeling Tree Bimorphisms
The fundamental properties of the class QUASI of quasi-relabeling relations are investigated. A quasi-relabeling relation is a tree relation that is dened by a tree bimorphism (Ļ...
Andreas Maletti, Catalin Ionut Tîrnauca
ITA
2007
101views Communications» more  ITA 2007»
8 years 9 months 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
CAAP
1994
9 years 27 days ago
Some Results on Top-Context-Free Tree Languages
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...
Dieter Hofbauer, Maria Huber, Gregory Kucherov
ECML
2005
Springer
9 years 2 months ago
Learning (k, l)-Contextual Tree Languages for Information Extraction
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...
Stefan Raeymaekers, Maurice Bruynooghe, Jan Van de...
FCT
2007
Springer
9 years 3 months ago
On the Topological Complexity of Weakly Recognizable Tree Languages
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 <...
Jacques Duparc, Filip Murlak
books