Problem for mathematically minded XML experts

[MURATA Makoto]

>I would like to pose the following question to those of you with a
>mathematical bent who have some spare time (I'm not expecting the answer
>quickly - this is a holiday teaser I suspect!).

I gave a talk at XTech'99 on automatic construction of 
intersection/union/difference of schemata (or DTDs).  I even demonstrated 
my prototypical implementation.

>is there a formula that can be used to determine whether the same pair of
>elements are valid in both DTD1 and DTD2? If there is, is there a way to
>determine the difference caused by the following conditions being added:

If the intersection of two schemata (or DTDs) is not empty, there exists 
such elements.

My slides and annotated log file of my demonstration are available at:

	http://www.geocities.com/ResearchTriangle/Lab/6259/XTech99/index.htm

You might want to retrieve this single file which contains all HTML pages 
and image files.

	http://www.geocities.com/ResearchTriangle/Lab/6259/XTech99/xtech99.zip

An introduction to hedge automata is available at:

	ttp://www.geocities.com/ResearchTriangle/Lab/6259/hedge_nice.pdf

Makoto
 
Fuji Xerox Information Systems
 
Tel: +81-44-812-7230   Fax: +81-44-812-7231
E-mail: murata.makoto at fujixerox.co.jp

xml-dev: A list for W3C XML Developers. To post, mailto:xml-dev at ic.ac.uk
Archived as: http://www.lists.ic.ac.uk/hypermail/xml-dev/ and on CD-ROM/ISBN 981-02-3594-1
To unsubscribe, mailto:majordomo at ic.ac.uk the following message;
unsubscribe xml-dev
To subscribe to the digests, mailto:majordomo at ic.ac.uk the following message;
subscribe xml-dev-digest
List coordinator, Henry Rzepa (mailto:rzepa at ic.ac.uk)