An extension of data automata that captures XPath

DOI10.2168/LMCS-8(1:5)2012zbMath1241.68077arXiv1201.0597OpenAlexW2054193719MaRDI QIDQ2881071

Sławomir Lasota, Mikołaj Bojańczyk

Publication date: 3 April 2012

Published in: Logical Methods in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1201.0597

zbMATH Keywords

data automataautomata on data words and treesregular XPathsatisfiability of XPath queries

Mathematics Subject Classification ID

Searching and sorting (68P10) Formal languages and automata (68Q45)

Related Items (5)

On temporal logics with data variable quantifications: decidability and complexity ⋮ Nondeterministic and co-nondeterministic implies deterministic, for data languages ⋮ A Note on C² Interpreted over Finite Data-Words ⋮ An Automaton over Data Words That Captures EMSO Logic ⋮ The factorisation forest theorem

Uses Software

• XPath

This page was built for publication: An extension of data automata that captures XPath