Alternating automata on data trees and XPath satisfiability
Jurdzinski, Marcin and Lazic, Ranko. (2011) Alternating automata on data trees and XPath satisfiability. ACM Transactions on Computational Logic (TOCL), Volume 12 (Number 3). pp. 1-21. ISSN 1529-3785Full text not available from this repository.
Official URL: http://dx.doi.org/10.1145/1929954.1929956
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.
|Item Type:||Journal Article|
|Subjects:||Q Science > QA Mathematics
Q Science > QA Mathematics > QA76 Electronic computers. Computer science. Computer software
|Divisions:||Faculty of Science > Computer Science|
|Library of Congress Subject Headings (LCSH):||Algorithms, Machine theory, Trees (Graph theory), Data mining, Query languages (Computer science)|
|Journal or Publication Title:||ACM Transactions on Computational Logic (TOCL)|
|Publisher:||Association for Computing Machinery, Inc.|
|Page Range:||pp. 1-21|
ALPERN, B. AND SCHNEIDER, F. B. 1987. Recognizing safety and liveness. Distr. Comput. 2, 3, 117–126.
Actions (login required)