MSO queries on trees

DOI10.1145/2603088.2603137zbMath1401.68064OpenAlexW1985558974MaRDI QIDQ4635652

Wim Martens, Katja Losemann

Publication date: 23 April 2018

Published in: Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/2603088.2603137

zbMATH Keywords

tree automataXPathquery enumeration

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Database theory (68P15) Formal languages and automata (68Q45) Logic in computer science (03B70) Data structures (68P05)

Related Items (4)

Unnamed Item ⋮ Trade-offs in Static and Dynamic Evaluation of Hierarchical Queries ⋮ Unnamed Item ⋮ Intersection joins under updates

This page was built for publication: MSO queries on trees