Mikołaj Bojańczyk ; Sławomir Lasota - An extension of data automata that captures XPath

lmcs:672 - Logical Methods in Computer Science, February 16, 2012, Volume 8, Issue 1 - https://doi.org/10.2168/LMCS-8(1:5)2012
An extension of data automata that captures XPathArticle

Authors: Mikołaj Bojańczyk ; Sławomir Lasota ORCID

We define a new kind of automata recognizing properties of data words or data trees and prove that the automata capture all queries definable in Regular XPath. We show that the automata-theoretic approach may be applied to answer decidability and expressibility questions for XPath.

https://doi.org/10.2168/LMCS-8(1:5)2012
Source: arXiv.org:1201.0597
Volume: Volume 8, Issue 1
Secondary volumes: Selected Papers of the 25th IEEE Symposium on Logic in Computer Science (LICS 2010)
Published on: February 16, 2012
Imported on: March 9, 2011
Keywords: Computer Science - Logic in Computer Science, Computer Science - Formal Languages and Automata Theory, F.1.1, H.2.3
Licence: arXiv.org - Non-exclusive license to distribute
Funding:
    Source : OpenAIRE Graph
  • Foundations of XML - Safe Processing of Dynamic Data over the Internet; Funder: European Commission; Code: 233599

Classifications

Mathematics Subject Classification 20201
Sources:
  • [1] zbMATH Open.

8 Documents citing this article

Share and export

Consultation statistics

This page has been seen 3063 times.
This article's PDF has been downloaded 472 times.