Results 1  10
of
49,272
Tree Algebras
"... Many important families of regular languages have effective characterizations in terms of syntactic monoids or syntactic semigroups (see e.g. [1]). Definition of the syntactic monoid (resp. syntactic semigroup) of a language L ⊆ X ∗ (resp. a language L ⊆ X +) over an alphabet X requires regarding L ..."
Abstract
 Add to MetaCart
L as a subset of the free monoid X ∗ (resp. free semigroup X +). On the other hand tree languages have traditionally been regarded as subsets of term algebras. So it appears natural to base the classification of regular tree languages over a ranked alphabet Σ on their syntactic algebras as was done
TAX: A Tree Algebra for XML
 In Proc. DBPL Conf
, 2001
"... Querying XML has been the subject of much recent investigation. A formal bulk algebra is essential for applying databasestyle optimization to XML queries. We develop such an algebra, called TAX (Tree Algebra for XML), for manipulating XML data, modeled as forests of labeled ordered trees. Motivated ..."
Abstract

Cited by 124 (14 self)
 Add to MetaCart
Querying XML has been the subject of much recent investigation. A formal bulk algebra is essential for applying databasestyle optimization to XML queries. We develop such an algebra, called TAX (Tree Algebra for XML), for manipulating XML data, modeled as forests of labeled ordered trees
Derivedtame Tree Algebras
"... In this note we classify the derivedtame tree algebras up to derived equivalence. A tree algebra is a basic algebra A = kQ/I whose quiver Q is a tree. The algebra A is said to be derivedtame when the repetitive category A of A is tame. We show that the tree algebra A is derivedtame precisely wh ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
In this note we classify the derivedtame tree algebras up to derived equivalence. A tree algebra is a basic algebra A = kQ/I whose quiver Q is a tree. The algebra A is said to be derivedtame when the repetitive category A of A is tame. We show that the tree algebra A is derivedtame precisely
GRADED BRAUER TREE ALGEBRAS
, 810
"... Abstract. In this paper we construct nonnegative gradings on a basic Brauer tree algebra AΓ corresponding to an arbitrary Brauer tree Γ of type (m, e). We do this by transferring gradings via derived equivalence from a basic Brauer tree algebra AS, whose tree is a star with the exceptional vertex i ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
Abstract. In this paper we construct nonnegative gradings on a basic Brauer tree algebra AΓ corresponding to an arbitrary Brauer tree Γ of type (m, e). We do this by transferring gradings via derived equivalence from a basic Brauer tree algebra AS, whose tree is a star with the exceptional vertex
The Ptree Algebra
, 2002
"... The Peano Count Tree (Ptree) is a quadrantbased lossless tree representation of the original spatial data. The idea of Ptree is to recursively divide the entire spatial data, such as Remotely Sensed Imagery data, into quadrants and record the count of 1bits for each quadrant, thus forming a quad ..."
Abstract

Cited by 23 (11 self)
 Add to MetaCart
quadrant count tree. Using Ptree structure, all the count information can be calculated quickly. This facilitates efficient ways for data mining. In this paper, we will focus on the algebra and properties of Ptree structure and its variations. We have implemented fast algorithms for Ptree generation
Higher Dimensional Trees, Algebraically
"... Abstract. In formal language theory, James Rogers published a series of innovative papers generalising strings and trees to higher dimensions.Motivated by applications in linguistics, his goal was to smoothly extend the core theory of the formal languages of strings and trees to these higher dimensi ..."
Abstract
 Add to MetaCart
dimensions. Rogers ’ definitions focussed on a specific representation of higher dimensional trees. This paper presents an alternative approach which focusses more on their universal properties and is based upon category theory, algebras, coalgebras and containers. Our approach reveals that Rogers ’ trees
Unranked Tree Algebra
, 2005
"... If in a transformation semigroup we assume that the set being acted upon has a semigroup structure, then the transformation semigroup can be used to recognize languages of unranked trees. This observation allows us to examine the relationship connecting languages of unranked trees with standard alge ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
If in a transformation semigroup we assume that the set being acted upon has a semigroup structure, then the transformation semigroup can be used to recognize languages of unranked trees. This observation allows us to examine the relationship connecting languages of unranked trees with standard
Tree algebras, semidiscreteness, and dilation theory
 Proc. London Math. Soc.(3) 68
, 1994
"... We introduce a class of finitedimensional algebras built from a partial order generated as a transitive relation from a finite tree. These algebras, known as tree algebras, have the property that every locally contractive representation has a *dilation. Furthermore, they satisfy an appropriate ana ..."
Abstract

Cited by 5 (4 self)
 Add to MetaCart
We introduce a class of finitedimensional algebras built from a partial order generated as a transitive relation from a finite tree. These algebras, known as tree algebras, have the property that every locally contractive representation has a *dilation. Furthermore, they satisfy an appropriate
Pattern tree algebras: sets or sequences?
"... XML and XQuery semantics are very sensitive to the order of the produced output. Although patterntree based algebraic approaches are becoming more and more popular for evaluating XML, there is no universally accepted technique which can guarantee both a correct output order and a choice of efficie ..."
Abstract
 Add to MetaCart
XML and XQuery semantics are very sensitive to the order of the produced output. Although patterntree based algebraic approaches are becoming more and more popular for evaluating XML, there is no universally accepted technique which can guarantee both a correct output order and a choice
Results 1  10
of
49,272