Bottom-up automata on data trees and vertical XPath

DOI10.23638/LMCS-13(4:5)2017zbMATH Open1398.68107arXiv1710.08748MaRDI QIDQ4596782FDOQ4596782

Authors: Diego Figueira, Luc Segoufin 

Publication date: 11 December 2017

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

Recommendations

• scientific article; zbMATH DE number 5999538
• Alternating automata on data trees and XPath satisfiability
• Bounded Depth Data Trees
• Alternating register automata on finite words and trees
• Definability for downward and vertical XPath on data trees

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Data structures (68P05)

Cited In (12)

• Bounded Depth Data Trees
• Fixed points and Noetherian topologies
• Alternating register automata on finite words and trees
• An extension of data automata that captures XPath
• Decidability of downward XPath
• An automata model for trees with ordered data values
• Model theory of XPath on data trees. II: Binary bisimulation and definability
• \(\mathsf{FO}^2(<,+1,\sim)\) on data trees, data tree automata and branching vector addition systems
• Title not available (Why is that?)
• Definability for downward and vertical XPath on data trees
• Extending two-variable logic on data trees with order on data values and its automata
• Alternating automata on data trees and XPath satisfiability

This page was built for publication: Bottom-up automata on data trees and vertical \(\mathsf{XPath}\)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4596782)