Re: CYK & Context-Free Expressions
- From: Rock Brentwood <markwh04@xxxxxxxxx>
- Date: Thu, 1 May 2008 16:34:49 -0700 (PDT)
On Apr 28, 12:58 pm, Tegiri Nenashi <TegiriNena...@xxxxxxxxx> wrote:
On Apr 28, 12:58 pm, Tegiri Nenashi <TegiriNena...@xxxxxxxxx> wrote:
BTW, speaking of trees, what is algebraic definition of tree
structure?
An element of a free magma.
A magma is an "algebra without axioms". That is, it's an algebra
comprising a signature plus no axioms. So the magma generated freely
from a set X is the same thing as the term language over the same
signature with members of X as its indeterminates.
The archetypical example of a magma is the one which has just one
operator -- a binary operator. The elements of this magma are then
binary trees.
Interesting cases arise if you start to consider magmas that are not
free; particularly those which admit solutions to fixed point
equations.
These constructs (forests,"node packing", etc) are too awkward to
genuinely believe for them to be the answer...
In large measure that's what motivated my movement a long time ago
away from tree/forest based formalisms in favor of a more algebraic
approach. You can clearly see the imprint of this, for instance, in
the REX regular expression utility (in comp.compilers), which
interestingly has had its underlying algebraic method translated in a
wide range of settings (perl, Prolog, XML-Schema).
.
- Follow-Ups:
- Re: CYK & Context-Free Expressions
- From: Tegiri Nenashi
- Re: CYK & Context-Free Expressions
- Prev by Date: Existential instantiation question
- Next by Date: Re: CYK & Context-Free Expressions
- Previous by thread: Existential instantiation question
- Next by thread: Re: CYK & Context-Free Expressions
- Index(es):
Relevant Pages
|