MSO queries on trees: enumerating answers under updates using forest algebras
DOI10.1145/3209108.3209144zbMATH Open1497.68153OpenAlexW2798396931MaRDI QIDQ5145354FDOQ5145354
Authors: Matthias Niewerth
Publication date: 20 January 2021
Published in: Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/3209108.3209144
Recommendations
Formal languages and automata (68Q45) Analysis of algorithms and problem complexity (68Q25) Data structures (68P05) Database theory (68P15) Logic in computer science (03B70)
Cited In (5)
- Enumeration of monadic second-order queries on trees
- Constant delay enumeration with FPT-preprocessing for conjunctive queries of bounded submodular width
- MSO queries on trees: enumerating answers under updates
- Enumeration on trees under relabelings
- MSO Queries on Tree Decomposable Structures Are Computable with Linear Delay
This page was built for publication: MSO queries on trees: enumerating answers under updates using forest algebras
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5145354)