Tree automata accept T-regular languages which belong to T-regular sets. T-regular sets are closed under boolean operations, and the methods for boolean operations with tree automata have been proposed. And also, there is a method for minimalization of deterministic tree automata. If XML(Extensible Markup Language) which is a set of trees belongs to T-regular sets, the schema can be shown with tree automata. If so, we can do boolean operations and minimalization of schema.
In this papar, we explain T-regular sets and tree automata. And then, we have proposed how to operate XML Schema based on tree automaton theory.
By: Kazuyo Yagishita and Hiroshi Maruyama
Published in: RT0346 in 2002
LIMITED DISTRIBUTION NOTICE:
This Research Report is available. This report has been submitted for publication outside of IBM and will probably be copyrighted if accepted for publication. It has been issued as a Research Report for early dissemination of its contents. In view of the transfer of copyright to the outside publisher, its distribution outside of IBM prior to publication should be limited to peer communications and specific requests. After outside publication, requests should be filled only by reprints or legally obtained copies of the article (e.g., payment of royalties). I have read and understand this notice and am a member of the scientific community outside or inside of IBM seeking a single copy only.
Questions about this service can be mailed to reports@us.ibm.com .