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 XPath

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

    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.


    Volume: Volume 8, Issue 1
    Published on: February 16, 2012
    Accepted on: June 25, 2015
    Submitted on: March 9, 2011
    Keywords: Computer Science - Logic in Computer Science,Computer Science - Formal Languages and Automata Theory,F.1.1, H.2.3
    Fundings :
      Source : OpenAIRE Research Graph
    • Foundations of XML - Safe Processing of Dynamic Data over the Internet; Funder: European Commission; Code: 233599

    Linked data

    Source : ScholeXplorer IsCitedBy DOI 10.4230/lipics.time.2020.17
    • 10.4230/lipics.time.2020.17
    A Note on C² Interpreted over Finite Data-Words
    Bednarczyk, Bartosz ; Witkowski, Piotr ;

    8 Documents citing this article

    Share

    Consultation statistics

    This page has been seen 344 times.
    This article's PDF has been downloaded 192 times.