Skip to Main content Skip to Navigation
Journal articles

Alternating register automata on finite words and trees

Abstract : We study alternating register automata on data words and data trees in relation to logics. A data word (resp. data tree) is a word (resp. tree) whose every position carries a label from a finite alphabet and a data value from an infinite domain. We investigate one-way automata with alternating control over data words or trees, with one register for storing data and comparing them for equality. This is a continuation of the study started by Demri, Lazi´cLazi´c and Jurdzi´nskiJurdzi´nski. From the standpoint of register automata models, this work aims at two objectives: (1) simplifying the existent decidability proofs for the emptiness problem for alternating register automata; and (2) exhibiting decidable extensions for these models. From the logical perspective, we show that (a) in the case of data words, satisfiability of LTL with one register and quantification over data values is decidable; and (b) the satisfiability problem for the so-called forward fragment of XPath on xml documents is decidable, even in the presence of DTDs and even of key constraints. The decidability is obtained through a reduction to the automata model introduced. This fragment contains the child, descendant, next-sibling and following-sibling axes, as well as data equality and inequality tests.
Complete list of metadata

Cited literature [27 references]  Display  Hide  Download
Contributor : Diego Figueira Connect in order to contact the contributor
Submitted on : Friday, May 25, 2018 - 9:49:17 AM
Last modification on : Thursday, January 20, 2022 - 5:28:53 PM
Long-term archiving on: : Sunday, August 26, 2018 - 12:58:33 PM


Files produced by the author(s)



Diego Figueira. Alternating register automata on finite words and trees. Logical Methods in Computer Science, Logical Methods in Computer Science Association, 2012, 8 (1), pp.1-44. ⟨10.2168/LMCS-8(1:22)2012⟩. ⟨hal-01799710⟩



Les métriques sont temporairement indisponibles