Alternating register automata on finite data words and trees

Logical Methods in Computer Science

Volumn 8, Issue 1, 2012, Pages

  Figueira, Diego ^a,b  

^a CNRS   (France)

^b UNIVERSITY OF EDINBURGH   (United Kingdom)

Author keywords

Alternating tree register automata; Data tree; Forward XPath; Infinite alphabet; Unranked ordered tree; XML

Indexed keywords

EID: 84859962396     PISSN: None     EISSN: 18605974     Source Type: Journal    
DOI: 10.2168/LMCS-8(1:22)2012     Document Type: Article

References (30)

1. Parosh Aziz Abdulla, Kārlis Čerāns, Bengt Jonsson, and Yih-Kuen Tsay. General decidability theorems for infinite-state systems. In Annual IEEE Symposium on Logic in Computer Science (LICS'96), pages 313-321, 1996.
2. Parosh Aziz Abdulla, Johann Deneux, Joël Ouaknine, and James Worrell. Decidability and complexity results for timed automata via channel machines. In International Colloquium on Automata, Languages and Programming (ICALP'05), pages 1089-1101, 2005.
3. Rajeev Alur and David L. Dill. A theory of timed automata. Theoretical Computer Science, 126: 183-235, 1994.
4. Michael Benedikt, Wenfei Fan, and Floris Geerts. XPath satisfiability in the presence of DTDs. Journal of the ACM, 55(2): 1-79, 2008.
5. Mikołaj Bojańczyk, Anca Muscholl, Thomas Schwentick, and Luc Segoufin. Two-variable logic on data trees and XML reasoning. Journal of the ACM, 56(3): 1-48, 2009.
6. Pierre Chambart and Philippe Schnoebelen. The ordinal recursive complexity of lossy channel systems. In Annual IEEE Symposium on Logic in Computer Science (LICS'08), pages 205-216. IEEE Computer Society Press, 2008.
7. James Clark and Steve DeRose. XML path language (XPath). Website, 1999. W3C Recommendation. http://www.w3.org/TR/xpath.
8. Stéphane Demri and Ranko Lazic. LTL with the freeze quantifier and register automata. ACM Transactions on Computational Logic, 10(3), 2009.
9. Stéphane Demri, Ranko Lazic, and David Nowak. On the freeze quantifier in constraint LTL: Decidability and complexity. In International Symposium on Temporal Representation and Reasoning (TIME'05), pages 113-121. IEEE Computer Society Press, 2005.
10. Leonard E. Dickson. Finiteness of the odd perfect and primitive abundant numbers with n distinct prime factors. The American Journal of Mathematics, 35(4): 413-422, 1913.
11. Diego Figueira. Satisfiability of downward XPath with data equality tests. In ACM Symposium on Principles of Database Systems (PODS'09), pages 197-206. ACM Press, 2009.
12. Diego Figueira. Forward-XPath and extended register automata on data-trees. In International Conference on Database Theory (ICDT'10). ACM Press, 2010.
13. Diego Figueira. Reasoning on Words and Trees with Data. Ph.D. thesis, Laboratoire Specification et Vérification, ENS Cachan, France, December 2010.
14. Diego Figueira. A decidable two-way logic on data words. In Annual IEEE Symposium on Logic in Computer Science (LICS'11). IEEE Computer Society Press, 2011.
15. Diego Figueira, Santiago Figueira, Sylvain Schmitz, and Philippe Schnoebelen. Ackermannian and primitive-recursive bounds with Dickson's lemma. In Annual IEEE Symposium on Logic in Computer-Science (LICS'11). IEEE Computer Society Press, 2011.
16. Diego Figueira, Piotr Hofman, and Slawomir Lasota. Relating timed and register automata. In International Workshop on Expressiveness in Concurrency (EXPRESS'10), 2010.
17. Diego Figueira and Luc Segoufin. Future-looking logics on data words and trees. In International Symposium on Mathematical Foundations of Computer Science (MFCS'09), volume 5734 of LNCS, pages 331-343. Springer, 2009.
18. Diego Figueira and Luc Segoufin. Bottom-up automata on data trees and vertical XPath. In International Symposium on Theoretical Aspects of Computer Science (STACS'11). Springer, 2011.
19. Alain Finkel and Philippe Schnoebelen. Well-structured transition systems everywhere! Theoretical Computer Science, 256(1-2): 63-92, 2001.
20. Floris Geerts and Wenfei Fan. Satisfiability of XPath queries with sibling axes. In International Symposium on Database Programming Languages (DBPL '05), volume 3774 of Lecture Notes in Computer Science, pages 122-137. Springer, 2005.
21. Georg Gottlob, Christoph Koch, and Reinhard Pichler. Efficient algorithms for processing XPath queries. ACM Transactions on Database Systems, 30(2): 444-491, 2005.
22. Graham Higman. Ordering by divisibility in abstract algebras. Proceedings of the London Mathematical Society (3), 2(7): 326-336, 1952.
23. Marcin Jurdziński and Ranko Lazić. Alternation-free modal mu-calculus for data trees. In Annual IEEE Symposium on Logic in Computer Science (LICS'07), pages 131-140. IEEE Computer Society Press, 2007.
24. Marcin Jurdziński and Ranko Lazic. Alternating automata on data trees and XPath satisfiability. ACM Transactions on Computational Logic, 12(3): 19, 2011.
25. Joseph B. Kruskal. Well-quasi-ordering, the tree theorem, and Vazsonyi's conjecture. Transactions of the American, Mathematical Society, 95(2): 210-225, 1960.
26. M.H. Löb and S.S. Wainer. Hierarchies of number theoretic functions, I. Archiv für Mathematische Logik und Grundlagenforschung, 13: 39-51, 1970.
27. Maarten Marx. XPath with conditional axis relations. In International Conference on Extending Database Technology (EDBT'04), volume 2992 of Lecture Notes in Computer Science, pages 477-494. Springer, 2004.
28. Philippe Schnoebelen. Revisiting Ackermann-hardness for lossy counter machines and reset Petri nets. In International Symposium on Mathematical Foundations of Computer Science (MFCS'10), volume 6281 of Lecture Notes in Computer Science, pages 616-628. Springer, 2010.
29. Balder ten Cate. The expressivity of XPath with transitive closure. In ACM Symposium on Principles of Database Systems (PODS'06), pages 328-337. ACM Press, 2006.
30. Balder ten Cate and Luc Segoufin. XPath, transitive closure logic, and nested tree walking automata. In ACM Symposium on Principles of Database Systems (P0DS'08), pages 251-260. ACM Press, 2008.