Forest Automata Formalism


From      owner-xml-dev@ic.ac.uk Tue Oct 20 15:08:35 1998
Date:     Tue, 20 Oct 1998 11:49:33 -0400
From:     Paul Prescod <papresco@technologist.com>
To:       xml-dev <xml-dev@ic.ac.uk>, tigue@oz.net, macherius@darmstadt.gmd.de,
          Sean Mc Grath <digitome@iol.ie>
Subject:  Forest Automata formalism

Several people have asked me about my paper on Forest Automata. Unfortunately, I haven't been able to find time to compile a decent bibliography, nor add the code examples I hoped to, but I'm going to release it anyhow. There is a partial(?) bibliography on Robin Cover's SGML/XML page.

My paper (sans biblio) can be found at:

      http://www.prescod.net/forest/shorttut.

Forest Automata theory is a formalism for describing SGML/XML validation. The formalism makes clear some obvious extensions to SGML/XML validationand can be used as a source of ideas and answers relating to DTD parameterization, "data types" (lexical data types), validation-in-context, query languages etc.

Hopefully I will find time or funding to expand this paper eventually, because there are many interesting highways and biways that it hints at but does not explore.

Paul Prescod - http://itrc.uwaterloo.ca/~papresco


4'33" is rarely performed as an encore. - Steve Newcomb
(for info about 4'33":
http://www.lenzo.com/~sburke/stuff/cage_433.html
http://www.intrex.net/rwgarr/johncage.htm)


xml-dev: A list for W3C XML Developers. To post, mailto:xml-dev@ic.ac.uk
Archived as: http://www.lists.ic.ac.uk/hypermail/xml-dev/
To (un)subscribe, mailto:majordomo@ic.ac.uk the following message;
(un)subscribe xml-dev
To subscribe to the digests, mailto:majordomo@ic.ac.uk the following message;
subscribe xml-dev-digest
List coordinator, Henry Rzepa (mailto:rzepa@ic.ac.uk)