Deciding equivalence of finite tree automata
SIAM Journal on Computing
One-unambiguous regular languages
Information and Computation
Consistent query answers in inconsistent databases
PODS '99 Proceedings of the eighteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Validating streaming XML documents
Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Word problems requiring exponential time(Preliminary Report)
STOC '73 Proceedings of the fifth annual ACM symposium on Theory of computing
A survey on tree edit distance and related problems
Theoretical Computer Science
Journal of Computer and System Sciences
On the minimization of XML Schemas and tree automata for unranked trees
Journal of Computer and System Sciences
Information preserving XML schema embedding
ACM Transactions on Database Systems (TODS)
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part II
Repair checking in inconsistent databases: algorithms and complexity
Proceedings of the 12th International Conference on Database Theory
Adding nesting structure to words
Journal of the ACM (JACM)
Efficient inclusion checking for deterministic tree automata and XML Schemas
Information and Computation
Simplifying XML schema: single-type approximations of regular tree languages
Proceedings of the twenty-ninth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Generating, sampling and counting subclasses of regular tree languages
Proceedings of the 14th International Conference on Database Theory
The cost of traveling between languages
ICALP'11 Proceedings of the 38th international conference on Automata, languages and programming - Volume Part II
Regular Repair of Specifications
LICS '11 Proceedings of the 2011 IEEE 26th Annual Symposium on Logic in Computer Science
Querying and repairing inconsistent XML data
WISE'05 Proceedings of the 6th international conference on Web Information Systems Engineering
Validity-sensitive querying of XML databases
EDBT'06 Proceedings of the 2006 international conference on Current Trends in Database Technology
Which DTDs are streaming bounded repairable?
Proceedings of the 16th International Conference on Database Theory
| Hi-index | 0.00 |
We consider the problem of repairing unranked trees (e.g., XML documents) satisfying a given restriction specification R (e.g., a DTD) into unranked trees satisfying a given target specification T. Specifically, we focus on the question of whether one can get from any tree in a regular language R to some tree in another regular language T with a finite, uniformly bounded, number of edit operations (i.e., deletions and insertions of nodes). We give effective characterizations of the pairs of specifications R and T for which such a uniform bound exists, and we study the complexity of the problem under different representations of the regular tree languages (e.g., non-deterministic stepwise automata, deterministic stepwise automata, DTDs). Finally, we point out some connections with the analogous problem for regular languages of words, which was previously studied in [6].