Learning regular sets from queries and counterexamples
Information and Computation
Deciding equivalence of finite tree automata
SIAM Journal on Computing
SIAM Journal on Computing
DTD inference for views of XML data
PODS '00 Proceedings of the nineteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Expressive and efficient pattern languages for tree-structured data (extended abstract)
PODS '00 Proceedings of the nineteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Query automata over finite trees
Theoretical Computer Science
Typechecking for Semistructured Data
DBPL '01 Revised Papers from the 8th International Workshop on Database Programming Languages
Query Evaluation on Compressed Trees (Extended Abstract)
LICS '03 Proceedings of the 18th Annual IEEE Symposium on Logic in Computer Science
Word problems requiring exponential time(Preliminary Report)
STOC '73 Proceedings of the fifth annual ACM symposium on Theory of computing
ACM SIGMOD Record
Minimizing finite automata is computationally hard
Theoretical Computer Science - Developments in language theory
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
Taxonomy of XML schema languages using formal language theory
ACM Transactions on Internet Technology (TOIT)
Which XML schemas admit 1-pass preorder typing?
ICDT'05 Proceedings of the 10th international conference on Database Theory
Deterministic automata on unranked trees
FCT'05 Proceedings of the 15th international conference on Fundamentals of Computation Theory
Two-variable logic on data trees and XML reasoning
Proceedings of the twenty-fifth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Expressiveness and complexity of XML Schema
ACM Transactions on Database Systems (TODS)
Journal of Computer and System Sciences
Proceedings of the twenty-sixth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Static analysis of XML processing with data values
ACM SIGMOD Record
Two-variable logic on data trees and XML reasoning
Journal of the ACM (JACM)
Adding nesting structure to words
Journal of the ACM (JACM)
Bisimulation Minimisation of Weighted Automata on Unranked Trees
Fundamenta Informaticae
Optimizing schema languages for XML: numerical constraints and interleaving
ICDT'07 Proceedings of the 11th international conference on Database Theory
N-ary queries by tree automata
DBPL'05 Proceedings of the 10th international conference on Database Programming Languages
Bisimulation Minimisation of Weighted Automata on Unranked Trees
Fundamenta Informaticae
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
| Hi-index | 0.00 |
Automata for unranked trees form a foundation for XML schemas, querying and pattern languages. We study the problem of efficiently minimizing such automata. We start with the unranked tree automata (UTAs) that are standard in database theory, assuming bottom-up determinism and that horizontal recursion is represented by deterministic finite automata. We show that minimal UTAs in that class are not unique and that minimization is np-hard. We then study more recent automata classes that do allow for polynomial time minimization. Among those, we show that bottom-up deterministic stepwise tree automata yield the most succinct representations.