On 13 jun, 23:56, Vadim Tropashko <vadimtro_inva..._at_yahoo.com> wrote:
>
> [...] Then, your reply was a critical for me
> understanding that the tree structure is unnecessary, the derivation
> is essentially a language -- a set of words (which includes both
> terminals and nonterminals) and this set of words can be quieried
> solely with the language theory means. Formally, a query is a language
> intersection.
Of course, all computation, including RDBMS and XML querying and
transformation, is ultimately just string manipulation. Doesn't mean
that Turing Machines are always the most appropriate formalism for
describing them, does it? :-)
Received on Wed Jun 13 2007 - 17:47:01 CDT
