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
Automata theory for XML researchers
ACM SIGMOD Record
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
Incremental validation of XML documents
ACM Transactions on Database Systems (TODS)
Minimizing finite automata is computationally hard
Theoretical Computer Science - Developments in language theory
The complexity of XPath query evaluation and XML typing
Journal of the ACM (JACM)
On the complexity of typechecking top-down XML transformations
Theoretical Computer Science - Database theory
RELAX NG
Taxonomy of XML schema languages using formal language theory
ACM Transactions on Internet Technology (TOIT)
Expressiveness and complexity of XML Schema
ACM Transactions on Database Systems (TODS)
Introduction to Automata Theory, Languages, and Computation (3rd Edition)
Introduction to Automata Theory, Languages, and Computation (3rd Edition)
Journal of Computer and System Sciences
An observation on time-storage trade off
Journal of Computer and System Sciences
Deterministic automata on unranked trees
FCT'05 Proceedings of the 15th international conference on Fundamentals of Computation Theory
Learning n-ary node selecting tree transducers from completely annotated examples
ICGI'06 Proceedings of the 8th international conference on Grammatical Inference: algorithms and applications
Inferring XML schema definitions from XML data
VLDB '07 Proceedings of the 33rd international conference on Very large data bases
Efficient Inclusion Checking for Deterministic Tree Automata and DTDs
Language and Automata Theory and Applications
A Kleene Theorem for Forest Languages
LATA '09 Proceedings of the 3rd International Conference on Language and Automata Theory and Applications
Running tree automata on probabilistic XML
Proceedings of the twenty-eighth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Operational state complexity of nested word automata
Theoretical Computer Science
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
XML schema computations: schema compatibility testing and subschema extraction
CIKM '10 Proceedings of the 19th ACM international conference on Information and knowledge management
Generating, sampling and counting subclasses of regular tree languages
Proceedings of the 14th International Conference on Database Theory
Queries on Xml streams with bounded delay and concurrency
Information and Computation
Journal of Computer and System Sciences
State trade-offs in unranked tree automata
DCFS'11 Proceedings of the 13th international conference on Descriptional complexity of formal systems
Learning n-ary node selecting tree transducers from completely annotated examples
ICGI'06 Proceedings of the 8th international conference on Grammatical Inference: algorithms and applications
State complexity of the concatenation of regular tree languages
Theoretical Computer Science
State complexity of kleene-star operations on trees
WTCS'12 Proceedings of the 2012 international conference on Theoretical Computer Science: computation, physics and beyond
Foundations of regular expressions in XML schema languages and SPARQL
PhD '12 Proceedings of the on SIGMOD/PODS 2012 PhD Symposium
Efficient inclusion testing for simple classes of unambiguous ω-automata
Information Processing Letters
Finding optimal probabilistic generators for XML collections
Proceedings of the 15th International Conference on Database Theory
Bounded repairability for regular tree languages
Proceedings of the 15th International Conference on Database Theory
Transformations Between Different Models of Unranked Bottom-Up Tree Automata
Fundamenta Informaticae
State complexity of projection and quotient on unranked trees
DCFS'12 Proceedings of the 14th international conference on Descriptional Complexity of Formal Systems
Lower bounds for the size of deterministic unranked tree automata
Theoretical Computer Science
Simplifying XML Schema: Single-type approximations of regular tree languages
Journal of Computer and System Sciences
| 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. First, we study unranked tree automata that are standard in database theory, assuming bottom-up determinism and that horizontal recursion is represented by deterministic finite automata. We show that minimal automata in that class are not unique and that minimization is np-complete. Second, we 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. Third, we investigate abstractions of XML schema languages. In particular, we show that the class of one-pass preorder typeable schemas allows for polynomial time minimization and unique minimal models.