Theoretical Computer Science
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
A Web Odyssey: from Codd to XML
PODS '01 Proceedings of the twentieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Learning XML
Query automata over finite trees
Theoretical Computer Science
A formal model for an expressive fragment of XSLT
Information Systems - Databases: Creation, management and utilization
CSL '02 Proceedings of the 16th International Workshop and 11th Annual Conference of the EACSL on Computer Science Logic
Typechecking for XML transformers
Journal of Computer and System Sciences - Special issue on PODS 2000
Finite state machines for strings over infinite alphabets
ACM Transactions on Computational Logic (TOCL)
Regular Expressions for Languages over Infinite Alphabets
Fundamenta Informaticae
SFCS '90 Proceedings of the 31st Annual Symposium on Foundations of Computer Science
The Power of Non-deterministic Reassignment in Infinite-Alphabet Pushdown Automata
Languages: From Formal to Natural
On the satisfiability of two-variable logic over data words
LPAR'10 Proceedings of the 17th international conference on Logic for programming, artificial intelligence, and reasoning
Alternating automata on data trees and XPath satisfiability
ACM Transactions on Computational Logic (TOCL)
Efficient reasoning about data trees via integer linear programming
Proceedings of the 14th International Conference on Database Theory
On the use of guards for logics with data
MFCS'11 Proceedings of the 36th international conference on Mathematical foundations of computer science
Regular path queries on graphs with data
Proceedings of the 15th International Conference on Database Theory
Efficient reasoning about data trees via integer linear programming
ACM Transactions on Database Systems (TODS)
An Automata Model for Trees with Ordered Data Values
LICS '12 Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer Science
On XPath with transitive axes and data tests
Proceedings of the 32nd symposium on Principles of database systems
| Hi-index | 0.00 |
A number of models of computation on trees labeled with symbols from an infinite alphabet is considered. We study closure and decision properties of each of the models and compare their computation power.