Alternating automata, the weak monadic theory of the tree, and its complexity
International Colloquium on Automata, Languages and Programming on Automata, languages and programming
Theoretical Computer Science
Intractability of decision problems for finite-memory automata
Theoretical Computer Science - Special issue on universal machines and computations
Well-structured transition systems everywhere!
Theoretical Computer Science
Alternating Automata and Logics over Infinite Words
TCS '00 Proceedings of the International Conference IFIP on Theoretical Computer Science, Exploring New Frontiers of Theoretical Informatics
An efficient single-pass query evaluator for XML data streams
Proceedings of the 2004 ACM symposium on Applied computing
Finite state machines for strings over infinite alphabets
ACM Transactions on Computational Logic (TOCL)
LICS '04 Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science
CTL Model Checking for Labelled Tree Queries
TIME '06 Proceedings of the Thirteenth International Symposium on Temporal Representation and Reasoning
Two-Variable Logic on Words with Data
LICS '06 Proceedings of the 21st Annual IEEE Symposium on Logic in Computer Science
Alternation-free modal mu-calculus for data trees
LICS '07 Proceedings of the 22nd Annual IEEE Symposium on Logic in Computer Science
XPath satisfiability in the presence of DTDs
Journal of the ACM (JACM)
LTL with the freeze quantifier and register automata
ACM Transactions on Computational Logic (TOCL)
Two-variable logic on data trees and XML reasoning
Journal of the ACM (JACM)
Satisfiability of downward XPath with data equality tests
Proceedings of the twenty-eighth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Tree automata over infinite alphabets
Pillars of computer science
FSTTCS'06 Proceedings of the 26th international conference on Foundations of Software Technology and Theoretical Computer Science
Satisfiability of XPath queries with sibling axes
DBPL'05 Proceedings of the 10th international conference on Database Programming Languages
Automata and logics for words and trees over an infinite alphabet
CSL'06 Proceedings of the 20th international conference on Computer Science Logic
On notions of regularity for data languages
FCT'07 Proceedings of the 16th international conference on Fundamentals of Computation Theory
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
On XPath with transitive axes and data tests
Proceedings of the 32nd symposium on Principles of database systems
The power of well-structured systems
CONCUR'13 Proceedings of the 24th international conference on Concurrency Theory
Extending two-variable logic on data trees with order on data values and its automata
ACM Transactions on Computational Logic (TOCL)
| Hi-index | 0.00 |
A data tree is an unranked ordered tree whose every node is labeled by a letter from a finite alphabet and an element (“datum”) from an infinite set, where the latter can only be compared for equality. The article considers alternating automata on data trees that can move downward and rightward, and have one register for storing data. The main results are that nonemptiness over finite data trees is decidable but not primitive recursive, and that nonemptiness of safety automata is decidable but not elementary. The proofs use nondeterministic tree automata with faulty counters. Allowing upward moves, leftward moves, or two registers, each causes undecidability. As corollaries, decidability is obtained for two data-sensitive fragments of the XPath query language.