Automata, Languages, and Machines
Automata, Languages, and Machines
Query automata over finite trees
Theoretical Computer Science
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
CSL '02 Proceedings of the 16th International Workshop and 11th Annual Conference of the EACSL on Computer Science Logic
Typechecking for Semistructured Data
DBPL '01 Revised Papers from the 8th International Workshop on Database Programming Languages
Typechecking for XML transformers
Journal of Computer and System Sciences - Special issue on PODS 2000
Which XML schemas admit 1-pass preorder typing?
ICDT'05 Proceedings of the 10th international conference on Database 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)
Interactive learning of node selecting tree transducer
Machine Learning
On the minimization of XML Schemas and tree automata for unranked trees
Journal of Computer and System Sciences
The complexity of reasoning about pattern-based XML schemas
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)
Bisimulation Minimisation of Weighted Automata on Unranked Trees
Fundamenta Informaticae
An automata theoretic approach to rational tree relations
SOFSEM'08 Proceedings of the 34th conference on Current trends in theory and practice of computer science
State trade-offs in unranked tree automata
DCFS'11 Proceedings of the 13th international conference on Descriptional complexity of formal systems
Optimizing schema languages for XML: numerical constraints and interleaving
ICDT'07 Proceedings of the 11th international conference on Database Theory
Minimizing tree automata for unranked trees
DBPL'05 Proceedings of the 10th international conference on Database Programming Languages
State complexity of kleene-star operations on trees
WTCS'12 Proceedings of the 2012 international conference on Theoretical Computer Science: computation, physics and beyond
Transformations Between Different Models of Unranked Bottom-Up Tree Automata
Fundamenta Informaticae
Bisimulation Minimisation of Weighted Automata on Unranked Trees
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
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
Which DTDs are streaming bounded repairable?
Proceedings of the 16th International Conference on Database Theory
| Hi-index | 0.00 |
We investigate bottom-up and top-down deterministic automata on unranked trees. We show that for an appropriate definition of bottom-up deterministic automata it is possible to minimize the number of states efficiently and to obtain a unique canonical representative of the accepted tree language. For top-down deterministic automata it is well known that they are less expressive than the non-deterministic ones. By generalizing a corresponding proof from the theory of ranked tree automata we show that it is decidable whether a given regular language of unranked trees can be recognized by a top-down deterministic automaton. The standard deterministic top-down model is slightly weaker than the model we use, where at each node the automaton can scan the sequence of the labels of its successors before deciding its next move.