scientific article

DOI10.4230/LIPIcs.STACS.2011.93zbMath1230.68128MaRDI QIDQ3113675

Luc Segoufin, Diego Figueira

Publication date: 23 January 2012

Full work available at URL: http://subs.emis.de/LIPIcs/frontdoor_c0d0.html

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

decidabilitydata treesXPathbottom-up tree automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Graph theory (including graph drawing) in computer science (68R10) Logic in computer science (03B70) Data structures (68P05)

Related Items (8)

Complexity results on register context-free grammars and related formalisms ⋮ Active learning for deterministic bottom-up nominal tree automata ⋮ An automata-theoretic approach to the verification of distributed algorithms ⋮ Logics of Repeating Values on Data Trees and Branching Counter Systems ⋮ On regular paths with counting and data tests ⋮ Extending two-variable logic on data trees with order on data values and its automata ⋮ Hilbert-Style Axiomatization for Hybrid XPath with Data ⋮ Unnamed Item

Uses Software

• XPath

This page was built for publication: