We study query rewriting using views (QRV) for XML. Our queries and views are regular tree languages (RTLs) represented by tree automata over marked alphabets, where the markers serve as “node selectors”. We formally define query rewriting using views for RTLs and give an automata-based algorithm to compute the maximally contained rewriting. The formalism we use is equal in power with Monadic S...

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 Sakakibara’s work, we introduce the algorithm LRTLC and we show that regular tree languages are learnable from equivalence and correction queries when the set of contexts is ordered by a Knuth-Bendix order. Moreover, a subclass...

Hierarchical multilabel classification (HMC) is a variant of classification where instances may belong to multiple classes organized in a hierarchy. The task is relevant for several application domains. This paper presents an empirical study of decision tree approaches to HMC in the area of functional genomics. We compare learning a single HMC tree (which makes predictions for all classes toget...

We associate a modal operator with each language belonging to a given class of regular tree languages and use the cascade product of tree automata to give an algebraic characterization of the expressive power of the resulting logic.

We provide examples of towers covers cusped hyperbolic 3-manifolds whose exponential homological torsion growth is explicitly computed in terms volume growth. These arise from abelian alternating links the thickened torus. A corollary that spanning tree entropy for each regular planar lattice given by a polyhedron.

We present provably correct interactive algorithms for learn ing regular grammars from positive examples and membership queries A structurally complete set of strings from a language L G corresponding to a target regular grammar G implicitly speci es a lattice of nite state automata FSA which contains a FSA MG corresponding to G The lattice is compactly represented as a version space and MG is ...

We present provably correct interactive algorithms for learning regular grammars from positive examples and membership queries. A structurally complete set of strings from a language L(G) corresponding to a target regular grammar G implicitly speciies a lattice of nite state automata (FSA) which contains a FSA MG corresponding to G. The lattice is compactly represented as a version-space and MG...

The concatenation of trees can be defined either as a sequential or a parallel operation, and the corresponding iterated operation gives an extension of Kleene-star to tree languages. Since the sequential tree concatenation is not associative, we get two essentially different iterated sequential concatenation operations that we call the bottom-up star and top-down star operation, respectively. ...

We generalize a learning algorithm by Drewes and Högberg [1] for regular tree languages based on a learning model proposed by Angluin [2] to recognizable tree languages of arbitrarily many dimensions, so-called multi-dimensional trees. Multi-dimensional trees over multidimensional tree domains have been defined by Rogers [3, 4]. However, since the algorithm by Drewes and Högberg relies on class...

This study was an attempt to explore the beliefs of Iranian EFL teachers about the role of grammar in English language teaching in both state schools and private language institutes. Data were collected through a questionnaire developed by Burgess and Etherington (2002), which consisted of 11 main subscales and was divided into two sections. The first section dealt with approaches to grammar te...