Computer Science – Databases
Scientific paper
2012-02-17
LMCS 8 (1:22) 2012
Computer Science
Databases
Scientific paper
10.2168/LMCS-8(1:22)2012
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, Lazic and Jurdzinski. 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.
No associations
LandOfFree
Alternating register automata on finite words and trees does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Alternating register automata on finite words and trees, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Alternating register automata on finite words and trees will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-36369