One-unambiguous regular languages
Information and Computation
On-the-Fly Analysis of Systems with Unbounded, Lossy FIFO Channels
CAV '98 Proceedings of the 10th International Conference on Computer Aided Verification
DTDs versus XML schema: a practical study
Proceedings of the 7th International Workshop on the Web and Databases: colocated with ACM SIGMOD/PODS 2004
Regular expression types for XML
ACM Transactions on Programming Languages and Systems (TOPLAS)
Frontiers of tractability for typechecking simple XML transformations
PODS '04 Proceedings of the twenty-third ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
On the complexity of typechecking top-down XML transformations
Theoretical Computer Science - Database theory
Impact of XML schema evolution on valid documents
Proceedings of the 7th annual ACM international workshop on Web information and data management
Taxonomy of XML schema languages using formal language theory
ACM Transactions on Internet Technology (TOIT)
An XML document transformation algorithm inferred from an edit script between DTDs
ADC '08 Proceedings of the nineteenth conference on Australasian database - Volume 75
Inclusion Test Algorithms for One-Unambiguous Regular Expressions
Proceedings of the 5th international colloquium on Theoretical Aspects of Computing
Subtyping algorithm of regular tree grammars with disjoint production rules
ICTAC'10 Proceedings of the 7th International colloquium conference on Theoretical aspects of computing
| Hi-index | 0.00 |
XML documents on a database should be revalidated whenever a DTD is updated, since the documents may no longer be valid against the DTD. Solving the inclusion problem for DTDs is essential to avoiding such an expensive revalidation, but the problem is shown to be PSPACE-complete. In this paper, we propose a subproblem of the inclusion problem in terms of edit operations to regular expressions, and show a polynomial-time algorithm for solving the subproblem. Then we consider the recognizability of the algorithm.